Termination w.r.t. Q proof of TRS/TRCSREx5_7_Luc97

Termination w.r.t. Q of the following Term Rewriting System could not be shown:

Q restricted rewrite system:
The TRS R consists of the following rules:

active(dbl(0)) → mark(0)
active(dbl(s(X))) → mark(s(s(dbl(X))))
active(dbls(nil)) → mark(nil)
active(dbls(cons(X, Y))) → mark(cons(dbl(X), dbls(Y)))
active(sel(0, cons(X, Y))) → mark(X)
active(sel(s(X), cons(Y, Z))) → mark(sel(X, Z))
active(indx(nil, X)) → mark(nil)
active(indx(cons(X, Y), Z)) → mark(cons(sel(X, Z), indx(Y, Z)))
active(from(X)) → mark(cons(X, from(s(X))))
active(dbl1(0)) → mark(01)
active(dbl1(s(X))) → mark(s1(s1(dbl1(X))))
active(sel1(0, cons(X, Y))) → mark(X)
active(sel1(s(X), cons(Y, Z))) → mark(sel1(X, Z))
active(quote(0)) → mark(01)
active(quote(s(X))) → mark(s1(quote(X)))
active(quote(dbl(X))) → mark(dbl1(X))
active(quote(sel(X, Y))) → mark(sel1(X, Y))
active(dbl(X)) → dbl(active(X))
active(dbls(X)) → dbls(active(X))
active(sel(X1, X2)) → sel(active(X1), X2)
active(sel(X1, X2)) → sel(X1, active(X2))
active(indx(X1, X2)) → indx(active(X1), X2)
active(dbl1(X)) → dbl1(active(X))
active(s1(X)) → s1(active(X))
active(sel1(X1, X2)) → sel1(active(X1), X2)
active(sel1(X1, X2)) → sel1(X1, active(X2))
active(quote(X)) → quote(active(X))
dbl(mark(X)) → mark(dbl(X))
dbls(mark(X)) → mark(dbls(X))
sel(mark(X1), X2) → mark(sel(X1, X2))
sel(X1, mark(X2)) → mark(sel(X1, X2))
indx(mark(X1), X2) → mark(indx(X1, X2))
dbl1(mark(X)) → mark(dbl1(X))
s1(mark(X)) → mark(s1(X))
sel1(mark(X1), X2) → mark(sel1(X1, X2))
sel1(X1, mark(X2)) → mark(sel1(X1, X2))
quote(mark(X)) → mark(quote(X))
proper(dbl(X)) → dbl(proper(X))
proper(0) → ok(0)
proper(s(X)) → s(proper(X))
proper(dbls(X)) → dbls(proper(X))
proper(nil) → ok(nil)
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(sel(X1, X2)) → sel(proper(X1), proper(X2))
proper(indx(X1, X2)) → indx(proper(X1), proper(X2))
proper(from(X)) → from(proper(X))
proper(dbl1(X)) → dbl1(proper(X))
proper(01) → ok(01)
proper(s1(X)) → s1(proper(X))
proper(sel1(X1, X2)) → sel1(proper(X1), proper(X2))
proper(quote(X)) → quote(proper(X))
dbl(ok(X)) → ok(dbl(X))
s(ok(X)) → ok(s(X))
dbls(ok(X)) → ok(dbls(X))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
sel(ok(X1), ok(X2)) → ok(sel(X1, X2))
indx(ok(X1), ok(X2)) → ok(indx(X1, X2))
from(ok(X)) → ok(from(X))
dbl1(ok(X)) → ok(dbl1(X))
s1(ok(X)) → ok(s1(X))
sel1(ok(X1), ok(X2)) → ok(sel1(X1, X2))
quote(ok(X)) → ok(quote(X))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

Q is empty.

↳ QTRS

  ↳ DependencyPairsProof

Q restricted rewrite system:
The TRS R consists of the following rules:

active(dbl(0)) → mark(0)
active(dbl(s(X))) → mark(s(s(dbl(X))))
active(dbls(nil)) → mark(nil)
active(dbls(cons(X, Y))) → mark(cons(dbl(X), dbls(Y)))
active(sel(0, cons(X, Y))) → mark(X)
active(sel(s(X), cons(Y, Z))) → mark(sel(X, Z))
active(indx(nil, X)) → mark(nil)
active(indx(cons(X, Y), Z)) → mark(cons(sel(X, Z), indx(Y, Z)))
active(from(X)) → mark(cons(X, from(s(X))))
active(dbl1(0)) → mark(01)
active(dbl1(s(X))) → mark(s1(s1(dbl1(X))))
active(sel1(0, cons(X, Y))) → mark(X)
active(sel1(s(X), cons(Y, Z))) → mark(sel1(X, Z))
active(quote(0)) → mark(01)
active(quote(s(X))) → mark(s1(quote(X)))
active(quote(dbl(X))) → mark(dbl1(X))
active(quote(sel(X, Y))) → mark(sel1(X, Y))
active(dbl(X)) → dbl(active(X))
active(dbls(X)) → dbls(active(X))
active(sel(X1, X2)) → sel(active(X1), X2)
active(sel(X1, X2)) → sel(X1, active(X2))
active(indx(X1, X2)) → indx(active(X1), X2)
active(dbl1(X)) → dbl1(active(X))
active(s1(X)) → s1(active(X))
active(sel1(X1, X2)) → sel1(active(X1), X2)
active(sel1(X1, X2)) → sel1(X1, active(X2))
active(quote(X)) → quote(active(X))
dbl(mark(X)) → mark(dbl(X))
dbls(mark(X)) → mark(dbls(X))
sel(mark(X1), X2) → mark(sel(X1, X2))
sel(X1, mark(X2)) → mark(sel(X1, X2))
indx(mark(X1), X2) → mark(indx(X1, X2))
dbl1(mark(X)) → mark(dbl1(X))
s1(mark(X)) → mark(s1(X))
sel1(mark(X1), X2) → mark(sel1(X1, X2))
sel1(X1, mark(X2)) → mark(sel1(X1, X2))
quote(mark(X)) → mark(quote(X))
proper(dbl(X)) → dbl(proper(X))
proper(0) → ok(0)
proper(s(X)) → s(proper(X))
proper(dbls(X)) → dbls(proper(X))
proper(nil) → ok(nil)
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(sel(X1, X2)) → sel(proper(X1), proper(X2))
proper(indx(X1, X2)) → indx(proper(X1), proper(X2))
proper(from(X)) → from(proper(X))
proper(dbl1(X)) → dbl1(proper(X))
proper(01) → ok(01)
proper(s1(X)) → s1(proper(X))
proper(sel1(X1, X2)) → sel1(proper(X1), proper(X2))
proper(quote(X)) → quote(proper(X))
dbl(ok(X)) → ok(dbl(X))
s(ok(X)) → ok(s(X))
dbls(ok(X)) → ok(dbls(X))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
sel(ok(X1), ok(X2)) → ok(sel(X1, X2))
indx(ok(X1), ok(X2)) → ok(indx(X1, X2))
from(ok(X)) → ok(from(X))
dbl1(ok(X)) → ok(dbl1(X))
s1(ok(X)) → ok(s1(X))
sel1(ok(X1), ok(X2)) → ok(sel1(X1, X2))
quote(ok(X)) → ok(quote(X))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

Q is empty.

Using Dependency Pairs [1,13] we result in the following initial DP problem:
Q DP problem:
The TRS P consists of the following rules:

PROPER(from(X)) → FROM(proper(X))
ACTIVE(from(X)) → FROM(s(X))
ACTIVE(sel(X1, X2)) → ACTIVE(X2)
ACTIVE(quote(X)) → ACTIVE(X)
ACTIVE(quote(sel(X, Y))) → SEL1(X, Y)
ACTIVE(sel1(s(X), cons(Y, Z))) → SEL1(X, Z)
SEL1(mark(X1), X2) → SEL1(X1, X2)
ACTIVE(sel1(X1, X2)) → ACTIVE(X2)
PROPER(s1(X)) → PROPER(X)
ACTIVE(dbl(s(X))) → DBL(X)
PROPER(quote(X)) → QUOTE(proper(X))
TOP(mark(X)) → TOP(proper(X))
ACTIVE(quote(s(X))) → QUOTE(X)
ACTIVE(sel1(X1, X2)) → ACTIVE(X1)
ACTIVE(dbl(X)) → ACTIVE(X)
PROPER(cons(X1, X2)) → PROPER(X1)
PROPER(sel1(X1, X2)) → SEL1(proper(X1), proper(X2))
PROPER(s1(X)) → S1(proper(X))
PROPER(indx(X1, X2)) → PROPER(X2)
ACTIVE(dbls(cons(X, Y))) → DBLS(Y)
PROPER(sel1(X1, X2)) → PROPER(X2)
PROPER(dbls(X)) → DBLS(proper(X))
PROPER(sel(X1, X2)) → PROPER(X2)
TOP(ok(X)) → ACTIVE(X)
ACTIVE(quote(s(X))) → S1(quote(X))
SEL(mark(X1), X2) → SEL(X1, X2)
ACTIVE(indx(X1, X2)) → INDX(active(X1), X2)
DBL1(ok(X)) → DBL1(X)
ACTIVE(indx(cons(X, Y), Z)) → INDX(Y, Z)
PROPER(s(X)) → PROPER(X)
ACTIVE(dbl1(s(X))) → DBL1(X)
ACTIVE(dbls(X)) → DBLS(active(X))
ACTIVE(quote(X)) → QUOTE(active(X))
ACTIVE(dbls(X)) → ACTIVE(X)
PROPER(indx(X1, X2)) → PROPER(X1)
ACTIVE(sel1(X1, X2)) → SEL1(active(X1), X2)
PROPER(dbl1(X)) → PROPER(X)
ACTIVE(dbls(cons(X, Y))) → DBL(X)
ACTIVE(dbl1(X)) → ACTIVE(X)
TOP(mark(X)) → PROPER(X)
ACTIVE(dbl1(X)) → DBL1(active(X))
SEL1(X1, mark(X2)) → SEL1(X1, X2)
DBL(ok(X)) → DBL(X)
PROPER(dbl1(X)) → DBL1(proper(X))
PROPER(sel(X1, X2)) → SEL(proper(X1), proper(X2))
S1(ok(X)) → S1(X)
DBLS(mark(X)) → DBLS(X)
ACTIVE(quote(dbl(X))) → DBL1(X)
ACTIVE(dbl(X)) → DBL(active(X))
ACTIVE(sel(X1, X2)) → SEL(X1, active(X2))
ACTIVE(sel1(X1, X2)) → SEL1(X1, active(X2))
ACTIVE(sel(s(X), cons(Y, Z))) → SEL(X, Z)
ACTIVE(sel(X1, X2)) → ACTIVE(X1)
SEL(X1, mark(X2)) → SEL(X1, X2)
PROPER(s(X)) → S(proper(X))
PROPER(indx(X1, X2)) → INDX(proper(X1), proper(X2))
PROPER(dbls(X)) → PROPER(X)
ACTIVE(indx(cons(X, Y), Z)) → CONS(sel(X, Z), indx(Y, Z))
ACTIVE(dbl1(s(X))) → S1(s1(dbl1(X)))
ACTIVE(s1(X)) → ACTIVE(X)
S(ok(X)) → S(X)
QUOTE(ok(X)) → QUOTE(X)
S1(mark(X)) → S1(X)
INDX(mark(X1), X2) → INDX(X1, X2)
ACTIVE(from(X)) → CONS(X, from(s(X)))
ACTIVE(indx(X1, X2)) → ACTIVE(X1)
PROPER(quote(X)) → PROPER(X)
DBLS(ok(X)) → DBLS(X)
PROPER(sel(X1, X2)) → PROPER(X1)
DBL(mark(X)) → DBL(X)
SEL(ok(X1), ok(X2)) → SEL(X1, X2)
ACTIVE(dbl1(s(X))) → S1(dbl1(X))
SEL1(ok(X1), ok(X2)) → SEL1(X1, X2)
ACTIVE(dbl(s(X))) → S(dbl(X))
ACTIVE(dbls(cons(X, Y))) → CONS(dbl(X), dbls(Y))
ACTIVE(s1(X)) → S1(active(X))
ACTIVE(from(X)) → S(X)
DBL1(mark(X)) → DBL1(X)
QUOTE(mark(X)) → QUOTE(X)
PROPER(cons(X1, X2)) → CONS(proper(X1), proper(X2))
PROPER(dbl(X)) → DBL(proper(X))
TOP(ok(X)) → TOP(active(X))
PROPER(from(X)) → PROPER(X)
PROPER(cons(X1, X2)) → PROPER(X2)
ACTIVE(sel(X1, X2)) → SEL(active(X1), X2)
PROPER(sel1(X1, X2)) → PROPER(X1)
CONS(ok(X1), ok(X2)) → CONS(X1, X2)
FROM(ok(X)) → FROM(X)
INDX(ok(X1), ok(X2)) → INDX(X1, X2)
ACTIVE(indx(cons(X, Y), Z)) → SEL(X, Z)
ACTIVE(dbl(s(X))) → S(s(dbl(X)))
PROPER(dbl(X)) → PROPER(X)

The TRS R consists of the following rules:

active(dbl(0)) → mark(0)
active(dbl(s(X))) → mark(s(s(dbl(X))))
active(dbls(nil)) → mark(nil)
active(dbls(cons(X, Y))) → mark(cons(dbl(X), dbls(Y)))
active(sel(0, cons(X, Y))) → mark(X)
active(sel(s(X), cons(Y, Z))) → mark(sel(X, Z))
active(indx(nil, X)) → mark(nil)
active(indx(cons(X, Y), Z)) → mark(cons(sel(X, Z), indx(Y, Z)))
active(from(X)) → mark(cons(X, from(s(X))))
active(dbl1(0)) → mark(01)
active(dbl1(s(X))) → mark(s1(s1(dbl1(X))))
active(sel1(0, cons(X, Y))) → mark(X)
active(sel1(s(X), cons(Y, Z))) → mark(sel1(X, Z))
active(quote(0)) → mark(01)
active(quote(s(X))) → mark(s1(quote(X)))
active(quote(dbl(X))) → mark(dbl1(X))
active(quote(sel(X, Y))) → mark(sel1(X, Y))
active(dbl(X)) → dbl(active(X))
active(dbls(X)) → dbls(active(X))
active(sel(X1, X2)) → sel(active(X1), X2)
active(sel(X1, X2)) → sel(X1, active(X2))
active(indx(X1, X2)) → indx(active(X1), X2)
active(dbl1(X)) → dbl1(active(X))
active(s1(X)) → s1(active(X))
active(sel1(X1, X2)) → sel1(active(X1), X2)
active(sel1(X1, X2)) → sel1(X1, active(X2))
active(quote(X)) → quote(active(X))
dbl(mark(X)) → mark(dbl(X))
dbls(mark(X)) → mark(dbls(X))
sel(mark(X1), X2) → mark(sel(X1, X2))
sel(X1, mark(X2)) → mark(sel(X1, X2))
indx(mark(X1), X2) → mark(indx(X1, X2))
dbl1(mark(X)) → mark(dbl1(X))
s1(mark(X)) → mark(s1(X))
sel1(mark(X1), X2) → mark(sel1(X1, X2))
sel1(X1, mark(X2)) → mark(sel1(X1, X2))
quote(mark(X)) → mark(quote(X))
proper(dbl(X)) → dbl(proper(X))
proper(0) → ok(0)
proper(s(X)) → s(proper(X))
proper(dbls(X)) → dbls(proper(X))
proper(nil) → ok(nil)
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(sel(X1, X2)) → sel(proper(X1), proper(X2))
proper(indx(X1, X2)) → indx(proper(X1), proper(X2))
proper(from(X)) → from(proper(X))
proper(dbl1(X)) → dbl1(proper(X))
proper(01) → ok(01)
proper(s1(X)) → s1(proper(X))
proper(sel1(X1, X2)) → sel1(proper(X1), proper(X2))
proper(quote(X)) → quote(proper(X))
dbl(ok(X)) → ok(dbl(X))
s(ok(X)) → ok(s(X))
dbls(ok(X)) → ok(dbls(X))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
sel(ok(X1), ok(X2)) → ok(sel(X1, X2))
indx(ok(X1), ok(X2)) → ok(indx(X1, X2))
from(ok(X)) → ok(from(X))
dbl1(ok(X)) → ok(dbl1(X))
s1(ok(X)) → ok(s1(X))
sel1(ok(X1), ok(X2)) → ok(sel1(X1, X2))
quote(ok(X)) → ok(quote(X))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ EdgeDeletionProof

Q DP problem:
The TRS P consists of the following rules:

PROPER(from(X)) → FROM(proper(X))
ACTIVE(from(X)) → FROM(s(X))
ACTIVE(sel(X1, X2)) → ACTIVE(X2)
ACTIVE(quote(X)) → ACTIVE(X)
ACTIVE(quote(sel(X, Y))) → SEL1(X, Y)
ACTIVE(sel1(s(X), cons(Y, Z))) → SEL1(X, Z)
SEL1(mark(X1), X2) → SEL1(X1, X2)
ACTIVE(sel1(X1, X2)) → ACTIVE(X2)
PROPER(s1(X)) → PROPER(X)
ACTIVE(dbl(s(X))) → DBL(X)
PROPER(quote(X)) → QUOTE(proper(X))
TOP(mark(X)) → TOP(proper(X))
ACTIVE(quote(s(X))) → QUOTE(X)
ACTIVE(sel1(X1, X2)) → ACTIVE(X1)
ACTIVE(dbl(X)) → ACTIVE(X)
PROPER(cons(X1, X2)) → PROPER(X1)
PROPER(sel1(X1, X2)) → SEL1(proper(X1), proper(X2))
PROPER(s1(X)) → S1(proper(X))
PROPER(indx(X1, X2)) → PROPER(X2)
ACTIVE(dbls(cons(X, Y))) → DBLS(Y)
PROPER(sel1(X1, X2)) → PROPER(X2)
PROPER(dbls(X)) → DBLS(proper(X))
PROPER(sel(X1, X2)) → PROPER(X2)
TOP(ok(X)) → ACTIVE(X)
ACTIVE(quote(s(X))) → S1(quote(X))
SEL(mark(X1), X2) → SEL(X1, X2)
ACTIVE(indx(X1, X2)) → INDX(active(X1), X2)
DBL1(ok(X)) → DBL1(X)
ACTIVE(indx(cons(X, Y), Z)) → INDX(Y, Z)
PROPER(s(X)) → PROPER(X)
ACTIVE(dbl1(s(X))) → DBL1(X)
ACTIVE(dbls(X)) → DBLS(active(X))
ACTIVE(quote(X)) → QUOTE(active(X))
ACTIVE(dbls(X)) → ACTIVE(X)
PROPER(indx(X1, X2)) → PROPER(X1)
ACTIVE(sel1(X1, X2)) → SEL1(active(X1), X2)
PROPER(dbl1(X)) → PROPER(X)
ACTIVE(dbls(cons(X, Y))) → DBL(X)
ACTIVE(dbl1(X)) → ACTIVE(X)
TOP(mark(X)) → PROPER(X)
ACTIVE(dbl1(X)) → DBL1(active(X))
SEL1(X1, mark(X2)) → SEL1(X1, X2)
DBL(ok(X)) → DBL(X)
PROPER(dbl1(X)) → DBL1(proper(X))
PROPER(sel(X1, X2)) → SEL(proper(X1), proper(X2))
S1(ok(X)) → S1(X)
DBLS(mark(X)) → DBLS(X)
ACTIVE(quote(dbl(X))) → DBL1(X)
ACTIVE(dbl(X)) → DBL(active(X))
ACTIVE(sel(X1, X2)) → SEL(X1, active(X2))
ACTIVE(sel1(X1, X2)) → SEL1(X1, active(X2))
ACTIVE(sel(s(X), cons(Y, Z))) → SEL(X, Z)
ACTIVE(sel(X1, X2)) → ACTIVE(X1)
SEL(X1, mark(X2)) → SEL(X1, X2)
PROPER(s(X)) → S(proper(X))
PROPER(indx(X1, X2)) → INDX(proper(X1), proper(X2))
PROPER(dbls(X)) → PROPER(X)
ACTIVE(indx(cons(X, Y), Z)) → CONS(sel(X, Z), indx(Y, Z))
ACTIVE(dbl1(s(X))) → S1(s1(dbl1(X)))
ACTIVE(s1(X)) → ACTIVE(X)
S(ok(X)) → S(X)
QUOTE(ok(X)) → QUOTE(X)
S1(mark(X)) → S1(X)
INDX(mark(X1), X2) → INDX(X1, X2)
ACTIVE(from(X)) → CONS(X, from(s(X)))
ACTIVE(indx(X1, X2)) → ACTIVE(X1)
PROPER(quote(X)) → PROPER(X)
DBLS(ok(X)) → DBLS(X)
PROPER(sel(X1, X2)) → PROPER(X1)
DBL(mark(X)) → DBL(X)
SEL(ok(X1), ok(X2)) → SEL(X1, X2)
ACTIVE(dbl1(s(X))) → S1(dbl1(X))
SEL1(ok(X1), ok(X2)) → SEL1(X1, X2)
ACTIVE(dbl(s(X))) → S(dbl(X))
ACTIVE(dbls(cons(X, Y))) → CONS(dbl(X), dbls(Y))
ACTIVE(s1(X)) → S1(active(X))
ACTIVE(from(X)) → S(X)
DBL1(mark(X)) → DBL1(X)
QUOTE(mark(X)) → QUOTE(X)
PROPER(cons(X1, X2)) → CONS(proper(X1), proper(X2))
PROPER(dbl(X)) → DBL(proper(X))
TOP(ok(X)) → TOP(active(X))
PROPER(from(X)) → PROPER(X)
PROPER(cons(X1, X2)) → PROPER(X2)
ACTIVE(sel(X1, X2)) → SEL(active(X1), X2)
PROPER(sel1(X1, X2)) → PROPER(X1)
CONS(ok(X1), ok(X2)) → CONS(X1, X2)
FROM(ok(X)) → FROM(X)
INDX(ok(X1), ok(X2)) → INDX(X1, X2)
ACTIVE(indx(cons(X, Y), Z)) → SEL(X, Z)
ACTIVE(dbl(s(X))) → S(s(dbl(X)))
PROPER(dbl(X)) → PROPER(X)

The TRS R consists of the following rules:

active(dbl(0)) → mark(0)
active(dbl(s(X))) → mark(s(s(dbl(X))))
active(dbls(nil)) → mark(nil)
active(dbls(cons(X, Y))) → mark(cons(dbl(X), dbls(Y)))
active(sel(0, cons(X, Y))) → mark(X)
active(sel(s(X), cons(Y, Z))) → mark(sel(X, Z))
active(indx(nil, X)) → mark(nil)
active(indx(cons(X, Y), Z)) → mark(cons(sel(X, Z), indx(Y, Z)))
active(from(X)) → mark(cons(X, from(s(X))))
active(dbl1(0)) → mark(01)
active(dbl1(s(X))) → mark(s1(s1(dbl1(X))))
active(sel1(0, cons(X, Y))) → mark(X)
active(sel1(s(X), cons(Y, Z))) → mark(sel1(X, Z))
active(quote(0)) → mark(01)
active(quote(s(X))) → mark(s1(quote(X)))
active(quote(dbl(X))) → mark(dbl1(X))
active(quote(sel(X, Y))) → mark(sel1(X, Y))
active(dbl(X)) → dbl(active(X))
active(dbls(X)) → dbls(active(X))
active(sel(X1, X2)) → sel(active(X1), X2)
active(sel(X1, X2)) → sel(X1, active(X2))
active(indx(X1, X2)) → indx(active(X1), X2)
active(dbl1(X)) → dbl1(active(X))
active(s1(X)) → s1(active(X))
active(sel1(X1, X2)) → sel1(active(X1), X2)
active(sel1(X1, X2)) → sel1(X1, active(X2))
active(quote(X)) → quote(active(X))
dbl(mark(X)) → mark(dbl(X))
dbls(mark(X)) → mark(dbls(X))
sel(mark(X1), X2) → mark(sel(X1, X2))
sel(X1, mark(X2)) → mark(sel(X1, X2))
indx(mark(X1), X2) → mark(indx(X1, X2))
dbl1(mark(X)) → mark(dbl1(X))
s1(mark(X)) → mark(s1(X))
sel1(mark(X1), X2) → mark(sel1(X1, X2))
sel1(X1, mark(X2)) → mark(sel1(X1, X2))
quote(mark(X)) → mark(quote(X))
proper(dbl(X)) → dbl(proper(X))
proper(0) → ok(0)
proper(s(X)) → s(proper(X))
proper(dbls(X)) → dbls(proper(X))
proper(nil) → ok(nil)
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(sel(X1, X2)) → sel(proper(X1), proper(X2))
proper(indx(X1, X2)) → indx(proper(X1), proper(X2))
proper(from(X)) → from(proper(X))
proper(dbl1(X)) → dbl1(proper(X))
proper(01) → ok(01)
proper(s1(X)) → s1(proper(X))
proper(sel1(X1, X2)) → sel1(proper(X1), proper(X2))
proper(quote(X)) → quote(proper(X))
dbl(ok(X)) → ok(dbl(X))
s(ok(X)) → ok(s(X))
dbls(ok(X)) → ok(dbls(X))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
sel(ok(X1), ok(X2)) → ok(sel(X1, X2))
indx(ok(X1), ok(X2)) → ok(indx(X1, X2))
from(ok(X)) → ok(from(X))
dbl1(ok(X)) → ok(dbl1(X))
s1(ok(X)) → ok(s1(X))
sel1(ok(X1), ok(X2)) → ok(sel1(X1, X2))
quote(ok(X)) → ok(quote(X))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We deleted some edges using various graph approximations

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ EdgeDeletionProof

        ↳ QDP

          ↳ DependencyGraphProof

Q DP problem:
The TRS P consists of the following rules:

ACTIVE(sel(X1, X2)) → ACTIVE(X2)
ACTIVE(from(X)) → FROM(s(X))
PROPER(from(X)) → FROM(proper(X))
ACTIVE(quote(X)) → ACTIVE(X)
ACTIVE(sel1(s(X), cons(Y, Z))) → SEL1(X, Z)
ACTIVE(quote(sel(X, Y))) → SEL1(X, Y)
SEL1(mark(X1), X2) → SEL1(X1, X2)
ACTIVE(sel1(X1, X2)) → ACTIVE(X2)
PROPER(s1(X)) → PROPER(X)
ACTIVE(dbl(s(X))) → DBL(X)
PROPER(quote(X)) → QUOTE(proper(X))
TOP(mark(X)) → TOP(proper(X))
ACTIVE(quote(s(X))) → QUOTE(X)
ACTIVE(sel1(X1, X2)) → ACTIVE(X1)
ACTIVE(dbl(X)) → ACTIVE(X)
PROPER(cons(X1, X2)) → PROPER(X1)
ACTIVE(dbls(cons(X, Y))) → DBLS(Y)
PROPER(indx(X1, X2)) → PROPER(X2)
PROPER(s1(X)) → S1(proper(X))
PROPER(sel1(X1, X2)) → SEL1(proper(X1), proper(X2))
PROPER(dbls(X)) → DBLS(proper(X))
PROPER(sel1(X1, X2)) → PROPER(X2)
PROPER(sel(X1, X2)) → PROPER(X2)
TOP(ok(X)) → ACTIVE(X)
SEL(mark(X1), X2) → SEL(X1, X2)
ACTIVE(quote(s(X))) → S1(quote(X))
ACTIVE(indx(X1, X2)) → INDX(active(X1), X2)
ACTIVE(indx(cons(X, Y), Z)) → INDX(Y, Z)
DBL1(ok(X)) → DBL1(X)
ACTIVE(dbl1(s(X))) → DBL1(X)
PROPER(s(X)) → PROPER(X)
ACTIVE(quote(X)) → QUOTE(active(X))
ACTIVE(dbls(X)) → DBLS(active(X))
ACTIVE(dbls(X)) → ACTIVE(X)
ACTIVE(sel1(X1, X2)) → SEL1(active(X1), X2)
PROPER(indx(X1, X2)) → PROPER(X1)
ACTIVE(dbls(cons(X, Y))) → DBL(X)
PROPER(dbl1(X)) → PROPER(X)
ACTIVE(dbl1(X)) → ACTIVE(X)
TOP(mark(X)) → PROPER(X)
ACTIVE(dbl1(X)) → DBL1(active(X))
SEL1(X1, mark(X2)) → SEL1(X1, X2)
PROPER(dbl1(X)) → DBL1(proper(X))
DBL(ok(X)) → DBL(X)
PROPER(sel(X1, X2)) → SEL(proper(X1), proper(X2))
DBLS(mark(X)) → DBLS(X)
S1(ok(X)) → S1(X)
ACTIVE(quote(dbl(X))) → DBL1(X)
ACTIVE(dbl(X)) → DBL(active(X))
ACTIVE(sel(X1, X2)) → SEL(X1, active(X2))
ACTIVE(sel1(X1, X2)) → SEL1(X1, active(X2))
ACTIVE(sel(s(X), cons(Y, Z))) → SEL(X, Z)
SEL(X1, mark(X2)) → SEL(X1, X2)
ACTIVE(sel(X1, X2)) → ACTIVE(X1)
PROPER(s(X)) → S(proper(X))
ACTIVE(indx(cons(X, Y), Z)) → CONS(sel(X, Z), indx(Y, Z))
PROPER(dbls(X)) → PROPER(X)
PROPER(indx(X1, X2)) → INDX(proper(X1), proper(X2))
ACTIVE(s1(X)) → ACTIVE(X)
ACTIVE(dbl1(s(X))) → S1(s1(dbl1(X)))
S(ok(X)) → S(X)
S1(mark(X)) → S1(X)
QUOTE(ok(X)) → QUOTE(X)
INDX(mark(X1), X2) → INDX(X1, X2)
ACTIVE(from(X)) → CONS(X, from(s(X)))
ACTIVE(indx(X1, X2)) → ACTIVE(X1)
PROPER(quote(X)) → PROPER(X)
DBLS(ok(X)) → DBLS(X)
PROPER(sel(X1, X2)) → PROPER(X1)
DBL(mark(X)) → DBL(X)
SEL(ok(X1), ok(X2)) → SEL(X1, X2)
ACTIVE(dbl1(s(X))) → S1(dbl1(X))
SEL1(ok(X1), ok(X2)) → SEL1(X1, X2)
ACTIVE(dbl(s(X))) → S(dbl(X))
ACTIVE(s1(X)) → S1(active(X))
ACTIVE(dbls(cons(X, Y))) → CONS(dbl(X), dbls(Y))
ACTIVE(from(X)) → S(X)
DBL1(mark(X)) → DBL1(X)
QUOTE(mark(X)) → QUOTE(X)
PROPER(dbl(X)) → DBL(proper(X))
PROPER(cons(X1, X2)) → CONS(proper(X1), proper(X2))
PROPER(from(X)) → PROPER(X)
TOP(ok(X)) → TOP(active(X))
ACTIVE(sel(X1, X2)) → SEL(active(X1), X2)
PROPER(cons(X1, X2)) → PROPER(X2)
PROPER(sel1(X1, X2)) → PROPER(X1)
CONS(ok(X1), ok(X2)) → CONS(X1, X2)
ACTIVE(indx(cons(X, Y), Z)) → SEL(X, Z)
INDX(ok(X1), ok(X2)) → INDX(X1, X2)
FROM(ok(X)) → FROM(X)
ACTIVE(dbl(s(X))) → S(s(dbl(X)))
PROPER(dbl(X)) → PROPER(X)

The TRS R consists of the following rules:

active(dbl(0)) → mark(0)
active(dbl(s(X))) → mark(s(s(dbl(X))))
active(dbls(nil)) → mark(nil)
active(dbls(cons(X, Y))) → mark(cons(dbl(X), dbls(Y)))
active(sel(0, cons(X, Y))) → mark(X)
active(sel(s(X), cons(Y, Z))) → mark(sel(X, Z))
active(indx(nil, X)) → mark(nil)
active(indx(cons(X, Y), Z)) → mark(cons(sel(X, Z), indx(Y, Z)))
active(from(X)) → mark(cons(X, from(s(X))))
active(dbl1(0)) → mark(01)
active(dbl1(s(X))) → mark(s1(s1(dbl1(X))))
active(sel1(0, cons(X, Y))) → mark(X)
active(sel1(s(X), cons(Y, Z))) → mark(sel1(X, Z))
active(quote(0)) → mark(01)
active(quote(s(X))) → mark(s1(quote(X)))
active(quote(dbl(X))) → mark(dbl1(X))
active(quote(sel(X, Y))) → mark(sel1(X, Y))
active(dbl(X)) → dbl(active(X))
active(dbls(X)) → dbls(active(X))
active(sel(X1, X2)) → sel(active(X1), X2)
active(sel(X1, X2)) → sel(X1, active(X2))
active(indx(X1, X2)) → indx(active(X1), X2)
active(dbl1(X)) → dbl1(active(X))
active(s1(X)) → s1(active(X))
active(sel1(X1, X2)) → sel1(active(X1), X2)
active(sel1(X1, X2)) → sel1(X1, active(X2))
active(quote(X)) → quote(active(X))
dbl(mark(X)) → mark(dbl(X))
dbls(mark(X)) → mark(dbls(X))
sel(mark(X1), X2) → mark(sel(X1, X2))
sel(X1, mark(X2)) → mark(sel(X1, X2))
indx(mark(X1), X2) → mark(indx(X1, X2))
dbl1(mark(X)) → mark(dbl1(X))
s1(mark(X)) → mark(s1(X))
sel1(mark(X1), X2) → mark(sel1(X1, X2))
sel1(X1, mark(X2)) → mark(sel1(X1, X2))
quote(mark(X)) → mark(quote(X))
proper(dbl(X)) → dbl(proper(X))
proper(0) → ok(0)
proper(s(X)) → s(proper(X))
proper(dbls(X)) → dbls(proper(X))
proper(nil) → ok(nil)
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(sel(X1, X2)) → sel(proper(X1), proper(X2))
proper(indx(X1, X2)) → indx(proper(X1), proper(X2))
proper(from(X)) → from(proper(X))
proper(dbl1(X)) → dbl1(proper(X))
proper(01) → ok(01)
proper(s1(X)) → s1(proper(X))
proper(sel1(X1, X2)) → sel1(proper(X1), proper(X2))
proper(quote(X)) → quote(proper(X))
dbl(ok(X)) → ok(dbl(X))
s(ok(X)) → ok(s(X))
dbls(ok(X)) → ok(dbls(X))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
sel(ok(X1), ok(X2)) → ok(sel(X1, X2))
indx(ok(X1), ok(X2)) → ok(indx(X1, X2))
from(ok(X)) → ok(from(X))
dbl1(ok(X)) → ok(dbl1(X))
s1(ok(X)) → ok(s1(X))
sel1(ok(X1), ok(X2)) → ok(sel1(X1, X2))
quote(ok(X)) → ok(quote(X))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The approximation of the Dependency Graph [13,14,18] contains 14 SCCs with 44 less nodes.

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ EdgeDeletionProof

        ↳ QDP

          ↳ DependencyGraphProof

            ↳ AND

              ↳ QDP

                ↳ QDPOrderProof

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

FROM(ok(X)) → FROM(X)

The TRS R consists of the following rules:

active(dbl(0)) → mark(0)
active(dbl(s(X))) → mark(s(s(dbl(X))))
active(dbls(nil)) → mark(nil)
active(dbls(cons(X, Y))) → mark(cons(dbl(X), dbls(Y)))
active(sel(0, cons(X, Y))) → mark(X)
active(sel(s(X), cons(Y, Z))) → mark(sel(X, Z))
active(indx(nil, X)) → mark(nil)
active(indx(cons(X, Y), Z)) → mark(cons(sel(X, Z), indx(Y, Z)))
active(from(X)) → mark(cons(X, from(s(X))))
active(dbl1(0)) → mark(01)
active(dbl1(s(X))) → mark(s1(s1(dbl1(X))))
active(sel1(0, cons(X, Y))) → mark(X)
active(sel1(s(X), cons(Y, Z))) → mark(sel1(X, Z))
active(quote(0)) → mark(01)
active(quote(s(X))) → mark(s1(quote(X)))
active(quote(dbl(X))) → mark(dbl1(X))
active(quote(sel(X, Y))) → mark(sel1(X, Y))
active(dbl(X)) → dbl(active(X))
active(dbls(X)) → dbls(active(X))
active(sel(X1, X2)) → sel(active(X1), X2)
active(sel(X1, X2)) → sel(X1, active(X2))
active(indx(X1, X2)) → indx(active(X1), X2)
active(dbl1(X)) → dbl1(active(X))
active(s1(X)) → s1(active(X))
active(sel1(X1, X2)) → sel1(active(X1), X2)
active(sel1(X1, X2)) → sel1(X1, active(X2))
active(quote(X)) → quote(active(X))
dbl(mark(X)) → mark(dbl(X))
dbls(mark(X)) → mark(dbls(X))
sel(mark(X1), X2) → mark(sel(X1, X2))
sel(X1, mark(X2)) → mark(sel(X1, X2))
indx(mark(X1), X2) → mark(indx(X1, X2))
dbl1(mark(X)) → mark(dbl1(X))
s1(mark(X)) → mark(s1(X))
sel1(mark(X1), X2) → mark(sel1(X1, X2))
sel1(X1, mark(X2)) → mark(sel1(X1, X2))
quote(mark(X)) → mark(quote(X))
proper(dbl(X)) → dbl(proper(X))
proper(0) → ok(0)
proper(s(X)) → s(proper(X))
proper(dbls(X)) → dbls(proper(X))
proper(nil) → ok(nil)
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(sel(X1, X2)) → sel(proper(X1), proper(X2))
proper(indx(X1, X2)) → indx(proper(X1), proper(X2))
proper(from(X)) → from(proper(X))
proper(dbl1(X)) → dbl1(proper(X))
proper(01) → ok(01)
proper(s1(X)) → s1(proper(X))
proper(sel1(X1, X2)) → sel1(proper(X1), proper(X2))
proper(quote(X)) → quote(proper(X))
dbl(ok(X)) → ok(dbl(X))
s(ok(X)) → ok(s(X))
dbls(ok(X)) → ok(dbls(X))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
sel(ok(X1), ok(X2)) → ok(sel(X1, X2))
indx(ok(X1), ok(X2)) → ok(indx(X1, X2))
from(ok(X)) → ok(from(X))
dbl1(ok(X)) → ok(dbl1(X))
s1(ok(X)) → ok(s1(X))
sel1(ok(X1), ok(X2)) → ok(sel1(X1, X2))
quote(ok(X)) → ok(quote(X))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].

The following pairs can be oriented strictly and are deleted.

FROM(ok(X)) → FROM(X)

The remaining pairs can at least be oriented weakly.
none
Used ordering: Combined order from the following AFS and order.
FROM(x1) = x1
ok(x1) = ok(x1)

Lexicographic Path Order [19].
Precedence:

trivial

The following usable rules [14] were oriented: none

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ EdgeDeletionProof

        ↳ QDP

          ↳ DependencyGraphProof

            ↳ AND

              ↳ QDP

                ↳ QDPOrderProof

                  ↳ QDP

                    ↳ PisEmptyProof

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

Q DP problem:
P is empty.
The TRS R consists of the following rules:

active(dbl(0)) → mark(0)
active(dbl(s(X))) → mark(s(s(dbl(X))))
active(dbls(nil)) → mark(nil)
active(dbls(cons(X, Y))) → mark(cons(dbl(X), dbls(Y)))
active(sel(0, cons(X, Y))) → mark(X)
active(sel(s(X), cons(Y, Z))) → mark(sel(X, Z))
active(indx(nil, X)) → mark(nil)
active(indx(cons(X, Y), Z)) → mark(cons(sel(X, Z), indx(Y, Z)))
active(from(X)) → mark(cons(X, from(s(X))))
active(dbl1(0)) → mark(01)
active(dbl1(s(X))) → mark(s1(s1(dbl1(X))))
active(sel1(0, cons(X, Y))) → mark(X)
active(sel1(s(X), cons(Y, Z))) → mark(sel1(X, Z))
active(quote(0)) → mark(01)
active(quote(s(X))) → mark(s1(quote(X)))
active(quote(dbl(X))) → mark(dbl1(X))
active(quote(sel(X, Y))) → mark(sel1(X, Y))
active(dbl(X)) → dbl(active(X))
active(dbls(X)) → dbls(active(X))
active(sel(X1, X2)) → sel(active(X1), X2)
active(sel(X1, X2)) → sel(X1, active(X2))
active(indx(X1, X2)) → indx(active(X1), X2)
active(dbl1(X)) → dbl1(active(X))
active(s1(X)) → s1(active(X))
active(sel1(X1, X2)) → sel1(active(X1), X2)
active(sel1(X1, X2)) → sel1(X1, active(X2))
active(quote(X)) → quote(active(X))
dbl(mark(X)) → mark(dbl(X))
dbls(mark(X)) → mark(dbls(X))
sel(mark(X1), X2) → mark(sel(X1, X2))
sel(X1, mark(X2)) → mark(sel(X1, X2))
indx(mark(X1), X2) → mark(indx(X1, X2))
dbl1(mark(X)) → mark(dbl1(X))
s1(mark(X)) → mark(s1(X))
sel1(mark(X1), X2) → mark(sel1(X1, X2))
sel1(X1, mark(X2)) → mark(sel1(X1, X2))
quote(mark(X)) → mark(quote(X))
proper(dbl(X)) → dbl(proper(X))
proper(0) → ok(0)
proper(s(X)) → s(proper(X))
proper(dbls(X)) → dbls(proper(X))
proper(nil) → ok(nil)
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(sel(X1, X2)) → sel(proper(X1), proper(X2))
proper(indx(X1, X2)) → indx(proper(X1), proper(X2))
proper(from(X)) → from(proper(X))
proper(dbl1(X)) → dbl1(proper(X))
proper(01) → ok(01)
proper(s1(X)) → s1(proper(X))
proper(sel1(X1, X2)) → sel1(proper(X1), proper(X2))
proper(quote(X)) → quote(proper(X))
dbl(ok(X)) → ok(dbl(X))
s(ok(X)) → ok(s(X))
dbls(ok(X)) → ok(dbls(X))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
sel(ok(X1), ok(X2)) → ok(sel(X1, X2))
indx(ok(X1), ok(X2)) → ok(indx(X1, X2))
from(ok(X)) → ok(from(X))
dbl1(ok(X)) → ok(dbl1(X))
s1(ok(X)) → ok(s1(X))
sel1(ok(X1), ok(X2)) → ok(sel1(X1, X2))
quote(ok(X)) → ok(quote(X))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The TRS P is empty. Hence, there is no (P,Q,R) chain.

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ EdgeDeletionProof

        ↳ QDP

          ↳ DependencyGraphProof

            ↳ AND

              ↳ QDP

              ↳ QDP

                ↳ QDPOrderProof

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

CONS(ok(X1), ok(X2)) → CONS(X1, X2)

The TRS R consists of the following rules:

active(dbl(0)) → mark(0)
active(dbl(s(X))) → mark(s(s(dbl(X))))
active(dbls(nil)) → mark(nil)
active(dbls(cons(X, Y))) → mark(cons(dbl(X), dbls(Y)))
active(sel(0, cons(X, Y))) → mark(X)
active(sel(s(X), cons(Y, Z))) → mark(sel(X, Z))
active(indx(nil, X)) → mark(nil)
active(indx(cons(X, Y), Z)) → mark(cons(sel(X, Z), indx(Y, Z)))
active(from(X)) → mark(cons(X, from(s(X))))
active(dbl1(0)) → mark(01)
active(dbl1(s(X))) → mark(s1(s1(dbl1(X))))
active(sel1(0, cons(X, Y))) → mark(X)
active(sel1(s(X), cons(Y, Z))) → mark(sel1(X, Z))
active(quote(0)) → mark(01)
active(quote(s(X))) → mark(s1(quote(X)))
active(quote(dbl(X))) → mark(dbl1(X))
active(quote(sel(X, Y))) → mark(sel1(X, Y))
active(dbl(X)) → dbl(active(X))
active(dbls(X)) → dbls(active(X))
active(sel(X1, X2)) → sel(active(X1), X2)
active(sel(X1, X2)) → sel(X1, active(X2))
active(indx(X1, X2)) → indx(active(X1), X2)
active(dbl1(X)) → dbl1(active(X))
active(s1(X)) → s1(active(X))
active(sel1(X1, X2)) → sel1(active(X1), X2)
active(sel1(X1, X2)) → sel1(X1, active(X2))
active(quote(X)) → quote(active(X))
dbl(mark(X)) → mark(dbl(X))
dbls(mark(X)) → mark(dbls(X))
sel(mark(X1), X2) → mark(sel(X1, X2))
sel(X1, mark(X2)) → mark(sel(X1, X2))
indx(mark(X1), X2) → mark(indx(X1, X2))
dbl1(mark(X)) → mark(dbl1(X))
s1(mark(X)) → mark(s1(X))
sel1(mark(X1), X2) → mark(sel1(X1, X2))
sel1(X1, mark(X2)) → mark(sel1(X1, X2))
quote(mark(X)) → mark(quote(X))
proper(dbl(X)) → dbl(proper(X))
proper(0) → ok(0)
proper(s(X)) → s(proper(X))
proper(dbls(X)) → dbls(proper(X))
proper(nil) → ok(nil)
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(sel(X1, X2)) → sel(proper(X1), proper(X2))
proper(indx(X1, X2)) → indx(proper(X1), proper(X2))
proper(from(X)) → from(proper(X))
proper(dbl1(X)) → dbl1(proper(X))
proper(01) → ok(01)
proper(s1(X)) → s1(proper(X))
proper(sel1(X1, X2)) → sel1(proper(X1), proper(X2))
proper(quote(X)) → quote(proper(X))
dbl(ok(X)) → ok(dbl(X))
s(ok(X)) → ok(s(X))
dbls(ok(X)) → ok(dbls(X))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
sel(ok(X1), ok(X2)) → ok(sel(X1, X2))
indx(ok(X1), ok(X2)) → ok(indx(X1, X2))
from(ok(X)) → ok(from(X))
dbl1(ok(X)) → ok(dbl1(X))
s1(ok(X)) → ok(s1(X))
sel1(ok(X1), ok(X2)) → ok(sel1(X1, X2))
quote(ok(X)) → ok(quote(X))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].

The following pairs can be oriented strictly and are deleted.

CONS(ok(X1), ok(X2)) → CONS(X1, X2)

The remaining pairs can at least be oriented weakly.
none
Used ordering: Combined order from the following AFS and order.
CONS(x1, x2) = x2
ok(x1) = ok(x1)

Lexicographic Path Order [19].
Precedence:

trivial

The following usable rules [14] were oriented: none

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ EdgeDeletionProof

        ↳ QDP

          ↳ DependencyGraphProof

            ↳ AND

              ↳ QDP

              ↳ QDP

                ↳ QDPOrderProof

                  ↳ QDP

                    ↳ PisEmptyProof

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

Q DP problem:
P is empty.
The TRS R consists of the following rules:

active(dbl(0)) → mark(0)
active(dbl(s(X))) → mark(s(s(dbl(X))))
active(dbls(nil)) → mark(nil)
active(dbls(cons(X, Y))) → mark(cons(dbl(X), dbls(Y)))
active(sel(0, cons(X, Y))) → mark(X)
active(sel(s(X), cons(Y, Z))) → mark(sel(X, Z))
active(indx(nil, X)) → mark(nil)
active(indx(cons(X, Y), Z)) → mark(cons(sel(X, Z), indx(Y, Z)))
active(from(X)) → mark(cons(X, from(s(X))))
active(dbl1(0)) → mark(01)
active(dbl1(s(X))) → mark(s1(s1(dbl1(X))))
active(sel1(0, cons(X, Y))) → mark(X)
active(sel1(s(X), cons(Y, Z))) → mark(sel1(X, Z))
active(quote(0)) → mark(01)
active(quote(s(X))) → mark(s1(quote(X)))
active(quote(dbl(X))) → mark(dbl1(X))
active(quote(sel(X, Y))) → mark(sel1(X, Y))
active(dbl(X)) → dbl(active(X))
active(dbls(X)) → dbls(active(X))
active(sel(X1, X2)) → sel(active(X1), X2)
active(sel(X1, X2)) → sel(X1, active(X2))
active(indx(X1, X2)) → indx(active(X1), X2)
active(dbl1(X)) → dbl1(active(X))
active(s1(X)) → s1(active(X))
active(sel1(X1, X2)) → sel1(active(X1), X2)
active(sel1(X1, X2)) → sel1(X1, active(X2))
active(quote(X)) → quote(active(X))
dbl(mark(X)) → mark(dbl(X))
dbls(mark(X)) → mark(dbls(X))
sel(mark(X1), X2) → mark(sel(X1, X2))
sel(X1, mark(X2)) → mark(sel(X1, X2))
indx(mark(X1), X2) → mark(indx(X1, X2))
dbl1(mark(X)) → mark(dbl1(X))
s1(mark(X)) → mark(s1(X))
sel1(mark(X1), X2) → mark(sel1(X1, X2))
sel1(X1, mark(X2)) → mark(sel1(X1, X2))
quote(mark(X)) → mark(quote(X))
proper(dbl(X)) → dbl(proper(X))
proper(0) → ok(0)
proper(s(X)) → s(proper(X))
proper(dbls(X)) → dbls(proper(X))
proper(nil) → ok(nil)
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(sel(X1, X2)) → sel(proper(X1), proper(X2))
proper(indx(X1, X2)) → indx(proper(X1), proper(X2))
proper(from(X)) → from(proper(X))
proper(dbl1(X)) → dbl1(proper(X))
proper(01) → ok(01)
proper(s1(X)) → s1(proper(X))
proper(sel1(X1, X2)) → sel1(proper(X1), proper(X2))
proper(quote(X)) → quote(proper(X))
dbl(ok(X)) → ok(dbl(X))
s(ok(X)) → ok(s(X))
dbls(ok(X)) → ok(dbls(X))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
sel(ok(X1), ok(X2)) → ok(sel(X1, X2))
indx(ok(X1), ok(X2)) → ok(indx(X1, X2))
from(ok(X)) → ok(from(X))
dbl1(ok(X)) → ok(dbl1(X))
s1(ok(X)) → ok(s1(X))
sel1(ok(X1), ok(X2)) → ok(sel1(X1, X2))
quote(ok(X)) → ok(quote(X))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The TRS P is empty. Hence, there is no (P,Q,R) chain.

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ EdgeDeletionProof

        ↳ QDP

          ↳ DependencyGraphProof

            ↳ AND

              ↳ QDP

              ↳ QDP

              ↳ QDP

                ↳ QDPOrderProof

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

S(ok(X)) → S(X)

The TRS R consists of the following rules:

active(dbl(0)) → mark(0)
active(dbl(s(X))) → mark(s(s(dbl(X))))
active(dbls(nil)) → mark(nil)
active(dbls(cons(X, Y))) → mark(cons(dbl(X), dbls(Y)))
active(sel(0, cons(X, Y))) → mark(X)
active(sel(s(X), cons(Y, Z))) → mark(sel(X, Z))
active(indx(nil, X)) → mark(nil)
active(indx(cons(X, Y), Z)) → mark(cons(sel(X, Z), indx(Y, Z)))
active(from(X)) → mark(cons(X, from(s(X))))
active(dbl1(0)) → mark(01)
active(dbl1(s(X))) → mark(s1(s1(dbl1(X))))
active(sel1(0, cons(X, Y))) → mark(X)
active(sel1(s(X), cons(Y, Z))) → mark(sel1(X, Z))
active(quote(0)) → mark(01)
active(quote(s(X))) → mark(s1(quote(X)))
active(quote(dbl(X))) → mark(dbl1(X))
active(quote(sel(X, Y))) → mark(sel1(X, Y))
active(dbl(X)) → dbl(active(X))
active(dbls(X)) → dbls(active(X))
active(sel(X1, X2)) → sel(active(X1), X2)
active(sel(X1, X2)) → sel(X1, active(X2))
active(indx(X1, X2)) → indx(active(X1), X2)
active(dbl1(X)) → dbl1(active(X))
active(s1(X)) → s1(active(X))
active(sel1(X1, X2)) → sel1(active(X1), X2)
active(sel1(X1, X2)) → sel1(X1, active(X2))
active(quote(X)) → quote(active(X))
dbl(mark(X)) → mark(dbl(X))
dbls(mark(X)) → mark(dbls(X))
sel(mark(X1), X2) → mark(sel(X1, X2))
sel(X1, mark(X2)) → mark(sel(X1, X2))
indx(mark(X1), X2) → mark(indx(X1, X2))
dbl1(mark(X)) → mark(dbl1(X))
s1(mark(X)) → mark(s1(X))
sel1(mark(X1), X2) → mark(sel1(X1, X2))
sel1(X1, mark(X2)) → mark(sel1(X1, X2))
quote(mark(X)) → mark(quote(X))
proper(dbl(X)) → dbl(proper(X))
proper(0) → ok(0)
proper(s(X)) → s(proper(X))
proper(dbls(X)) → dbls(proper(X))
proper(nil) → ok(nil)
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(sel(X1, X2)) → sel(proper(X1), proper(X2))
proper(indx(X1, X2)) → indx(proper(X1), proper(X2))
proper(from(X)) → from(proper(X))
proper(dbl1(X)) → dbl1(proper(X))
proper(01) → ok(01)
proper(s1(X)) → s1(proper(X))
proper(sel1(X1, X2)) → sel1(proper(X1), proper(X2))
proper(quote(X)) → quote(proper(X))
dbl(ok(X)) → ok(dbl(X))
s(ok(X)) → ok(s(X))
dbls(ok(X)) → ok(dbls(X))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
sel(ok(X1), ok(X2)) → ok(sel(X1, X2))
indx(ok(X1), ok(X2)) → ok(indx(X1, X2))
from(ok(X)) → ok(from(X))
dbl1(ok(X)) → ok(dbl1(X))
s1(ok(X)) → ok(s1(X))
sel1(ok(X1), ok(X2)) → ok(sel1(X1, X2))
quote(ok(X)) → ok(quote(X))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].

The following pairs can be oriented strictly and are deleted.

S(ok(X)) → S(X)

The remaining pairs can at least be oriented weakly.
none
Used ordering: Combined order from the following AFS and order.
S(x1) = x1
ok(x1) = ok(x1)

Lexicographic Path Order [19].
Precedence:

trivial

The following usable rules [14] were oriented: none

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ EdgeDeletionProof

        ↳ QDP

          ↳ DependencyGraphProof

            ↳ AND

              ↳ QDP

              ↳ QDP

              ↳ QDP

                ↳ QDPOrderProof

                  ↳ QDP

                    ↳ PisEmptyProof

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

Q DP problem:
P is empty.
The TRS R consists of the following rules:

active(dbl(0)) → mark(0)
active(dbl(s(X))) → mark(s(s(dbl(X))))
active(dbls(nil)) → mark(nil)
active(dbls(cons(X, Y))) → mark(cons(dbl(X), dbls(Y)))
active(sel(0, cons(X, Y))) → mark(X)
active(sel(s(X), cons(Y, Z))) → mark(sel(X, Z))
active(indx(nil, X)) → mark(nil)
active(indx(cons(X, Y), Z)) → mark(cons(sel(X, Z), indx(Y, Z)))
active(from(X)) → mark(cons(X, from(s(X))))
active(dbl1(0)) → mark(01)
active(dbl1(s(X))) → mark(s1(s1(dbl1(X))))
active(sel1(0, cons(X, Y))) → mark(X)
active(sel1(s(X), cons(Y, Z))) → mark(sel1(X, Z))
active(quote(0)) → mark(01)
active(quote(s(X))) → mark(s1(quote(X)))
active(quote(dbl(X))) → mark(dbl1(X))
active(quote(sel(X, Y))) → mark(sel1(X, Y))
active(dbl(X)) → dbl(active(X))
active(dbls(X)) → dbls(active(X))
active(sel(X1, X2)) → sel(active(X1), X2)
active(sel(X1, X2)) → sel(X1, active(X2))
active(indx(X1, X2)) → indx(active(X1), X2)
active(dbl1(X)) → dbl1(active(X))
active(s1(X)) → s1(active(X))
active(sel1(X1, X2)) → sel1(active(X1), X2)
active(sel1(X1, X2)) → sel1(X1, active(X2))
active(quote(X)) → quote(active(X))
dbl(mark(X)) → mark(dbl(X))
dbls(mark(X)) → mark(dbls(X))
sel(mark(X1), X2) → mark(sel(X1, X2))
sel(X1, mark(X2)) → mark(sel(X1, X2))
indx(mark(X1), X2) → mark(indx(X1, X2))
dbl1(mark(X)) → mark(dbl1(X))
s1(mark(X)) → mark(s1(X))
sel1(mark(X1), X2) → mark(sel1(X1, X2))
sel1(X1, mark(X2)) → mark(sel1(X1, X2))
quote(mark(X)) → mark(quote(X))
proper(dbl(X)) → dbl(proper(X))
proper(0) → ok(0)
proper(s(X)) → s(proper(X))
proper(dbls(X)) → dbls(proper(X))
proper(nil) → ok(nil)
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(sel(X1, X2)) → sel(proper(X1), proper(X2))
proper(indx(X1, X2)) → indx(proper(X1), proper(X2))
proper(from(X)) → from(proper(X))
proper(dbl1(X)) → dbl1(proper(X))
proper(01) → ok(01)
proper(s1(X)) → s1(proper(X))
proper(sel1(X1, X2)) → sel1(proper(X1), proper(X2))
proper(quote(X)) → quote(proper(X))
dbl(ok(X)) → ok(dbl(X))
s(ok(X)) → ok(s(X))
dbls(ok(X)) → ok(dbls(X))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
sel(ok(X1), ok(X2)) → ok(sel(X1, X2))
indx(ok(X1), ok(X2)) → ok(indx(X1, X2))
from(ok(X)) → ok(from(X))
dbl1(ok(X)) → ok(dbl1(X))
s1(ok(X)) → ok(s1(X))
sel1(ok(X1), ok(X2)) → ok(sel1(X1, X2))
quote(ok(X)) → ok(quote(X))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The TRS P is empty. Hence, there is no (P,Q,R) chain.

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ EdgeDeletionProof

        ↳ QDP

          ↳ DependencyGraphProof

            ↳ AND

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

                ↳ QDPOrderProof

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

QUOTE(mark(X)) → QUOTE(X)
QUOTE(ok(X)) → QUOTE(X)

The TRS R consists of the following rules:

active(dbl(0)) → mark(0)
active(dbl(s(X))) → mark(s(s(dbl(X))))
active(dbls(nil)) → mark(nil)
active(dbls(cons(X, Y))) → mark(cons(dbl(X), dbls(Y)))
active(sel(0, cons(X, Y))) → mark(X)
active(sel(s(X), cons(Y, Z))) → mark(sel(X, Z))
active(indx(nil, X)) → mark(nil)
active(indx(cons(X, Y), Z)) → mark(cons(sel(X, Z), indx(Y, Z)))
active(from(X)) → mark(cons(X, from(s(X))))
active(dbl1(0)) → mark(01)
active(dbl1(s(X))) → mark(s1(s1(dbl1(X))))
active(sel1(0, cons(X, Y))) → mark(X)
active(sel1(s(X), cons(Y, Z))) → mark(sel1(X, Z))
active(quote(0)) → mark(01)
active(quote(s(X))) → mark(s1(quote(X)))
active(quote(dbl(X))) → mark(dbl1(X))
active(quote(sel(X, Y))) → mark(sel1(X, Y))
active(dbl(X)) → dbl(active(X))
active(dbls(X)) → dbls(active(X))
active(sel(X1, X2)) → sel(active(X1), X2)
active(sel(X1, X2)) → sel(X1, active(X2))
active(indx(X1, X2)) → indx(active(X1), X2)
active(dbl1(X)) → dbl1(active(X))
active(s1(X)) → s1(active(X))
active(sel1(X1, X2)) → sel1(active(X1), X2)
active(sel1(X1, X2)) → sel1(X1, active(X2))
active(quote(X)) → quote(active(X))
dbl(mark(X)) → mark(dbl(X))
dbls(mark(X)) → mark(dbls(X))
sel(mark(X1), X2) → mark(sel(X1, X2))
sel(X1, mark(X2)) → mark(sel(X1, X2))
indx(mark(X1), X2) → mark(indx(X1, X2))
dbl1(mark(X)) → mark(dbl1(X))
s1(mark(X)) → mark(s1(X))
sel1(mark(X1), X2) → mark(sel1(X1, X2))
sel1(X1, mark(X2)) → mark(sel1(X1, X2))
quote(mark(X)) → mark(quote(X))
proper(dbl(X)) → dbl(proper(X))
proper(0) → ok(0)
proper(s(X)) → s(proper(X))
proper(dbls(X)) → dbls(proper(X))
proper(nil) → ok(nil)
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(sel(X1, X2)) → sel(proper(X1), proper(X2))
proper(indx(X1, X2)) → indx(proper(X1), proper(X2))
proper(from(X)) → from(proper(X))
proper(dbl1(X)) → dbl1(proper(X))
proper(01) → ok(01)
proper(s1(X)) → s1(proper(X))
proper(sel1(X1, X2)) → sel1(proper(X1), proper(X2))
proper(quote(X)) → quote(proper(X))
dbl(ok(X)) → ok(dbl(X))
s(ok(X)) → ok(s(X))
dbls(ok(X)) → ok(dbls(X))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
sel(ok(X1), ok(X2)) → ok(sel(X1, X2))
indx(ok(X1), ok(X2)) → ok(indx(X1, X2))
from(ok(X)) → ok(from(X))
dbl1(ok(X)) → ok(dbl1(X))
s1(ok(X)) → ok(s1(X))
sel1(ok(X1), ok(X2)) → ok(sel1(X1, X2))
quote(ok(X)) → ok(quote(X))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].

The following pairs can be oriented strictly and are deleted.

QUOTE(ok(X)) → QUOTE(X)

The remaining pairs can at least be oriented weakly.

QUOTE(mark(X)) → QUOTE(X)

Used ordering: Combined order from the following AFS and order.
QUOTE(x1) = x1
mark(x1) = x1
ok(x1) = ok(x1)

Lexicographic Path Order [19].
Precedence:

trivial

The following usable rules [14] were oriented: none

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ EdgeDeletionProof

        ↳ QDP

          ↳ DependencyGraphProof

            ↳ AND

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

                ↳ QDPOrderProof

                  ↳ QDP

                    ↳ QDPOrderProof

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

QUOTE(mark(X)) → QUOTE(X)

The TRS R consists of the following rules:

active(dbl(0)) → mark(0)
active(dbl(s(X))) → mark(s(s(dbl(X))))
active(dbls(nil)) → mark(nil)
active(dbls(cons(X, Y))) → mark(cons(dbl(X), dbls(Y)))
active(sel(0, cons(X, Y))) → mark(X)
active(sel(s(X), cons(Y, Z))) → mark(sel(X, Z))
active(indx(nil, X)) → mark(nil)
active(indx(cons(X, Y), Z)) → mark(cons(sel(X, Z), indx(Y, Z)))
active(from(X)) → mark(cons(X, from(s(X))))
active(dbl1(0)) → mark(01)
active(dbl1(s(X))) → mark(s1(s1(dbl1(X))))
active(sel1(0, cons(X, Y))) → mark(X)
active(sel1(s(X), cons(Y, Z))) → mark(sel1(X, Z))
active(quote(0)) → mark(01)
active(quote(s(X))) → mark(s1(quote(X)))
active(quote(dbl(X))) → mark(dbl1(X))
active(quote(sel(X, Y))) → mark(sel1(X, Y))
active(dbl(X)) → dbl(active(X))
active(dbls(X)) → dbls(active(X))
active(sel(X1, X2)) → sel(active(X1), X2)
active(sel(X1, X2)) → sel(X1, active(X2))
active(indx(X1, X2)) → indx(active(X1), X2)
active(dbl1(X)) → dbl1(active(X))
active(s1(X)) → s1(active(X))
active(sel1(X1, X2)) → sel1(active(X1), X2)
active(sel1(X1, X2)) → sel1(X1, active(X2))
active(quote(X)) → quote(active(X))
dbl(mark(X)) → mark(dbl(X))
dbls(mark(X)) → mark(dbls(X))
sel(mark(X1), X2) → mark(sel(X1, X2))
sel(X1, mark(X2)) → mark(sel(X1, X2))
indx(mark(X1), X2) → mark(indx(X1, X2))
dbl1(mark(X)) → mark(dbl1(X))
s1(mark(X)) → mark(s1(X))
sel1(mark(X1), X2) → mark(sel1(X1, X2))
sel1(X1, mark(X2)) → mark(sel1(X1, X2))
quote(mark(X)) → mark(quote(X))
proper(dbl(X)) → dbl(proper(X))
proper(0) → ok(0)
proper(s(X)) → s(proper(X))
proper(dbls(X)) → dbls(proper(X))
proper(nil) → ok(nil)
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(sel(X1, X2)) → sel(proper(X1), proper(X2))
proper(indx(X1, X2)) → indx(proper(X1), proper(X2))
proper(from(X)) → from(proper(X))
proper(dbl1(X)) → dbl1(proper(X))
proper(01) → ok(01)
proper(s1(X)) → s1(proper(X))
proper(sel1(X1, X2)) → sel1(proper(X1), proper(X2))
proper(quote(X)) → quote(proper(X))
dbl(ok(X)) → ok(dbl(X))
s(ok(X)) → ok(s(X))
dbls(ok(X)) → ok(dbls(X))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
sel(ok(X1), ok(X2)) → ok(sel(X1, X2))
indx(ok(X1), ok(X2)) → ok(indx(X1, X2))
from(ok(X)) → ok(from(X))
dbl1(ok(X)) → ok(dbl1(X))
s1(ok(X)) → ok(s1(X))
sel1(ok(X1), ok(X2)) → ok(sel1(X1, X2))
quote(ok(X)) → ok(quote(X))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].

The following pairs can be oriented strictly and are deleted.

QUOTE(mark(X)) → QUOTE(X)

The remaining pairs can at least be oriented weakly.
none
Used ordering: Combined order from the following AFS and order.
QUOTE(x1) = x1
mark(x1) = mark(x1)

Lexicographic Path Order [19].
Precedence:

trivial

The following usable rules [14] were oriented: none

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ EdgeDeletionProof

        ↳ QDP

          ↳ DependencyGraphProof

            ↳ AND

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

                ↳ QDPOrderProof

                  ↳ QDP

                    ↳ QDPOrderProof

                      ↳ QDP

                        ↳ PisEmptyProof

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

Q DP problem:
P is empty.
The TRS R consists of the following rules:

active(dbl(0)) → mark(0)
active(dbl(s(X))) → mark(s(s(dbl(X))))
active(dbls(nil)) → mark(nil)
active(dbls(cons(X, Y))) → mark(cons(dbl(X), dbls(Y)))
active(sel(0, cons(X, Y))) → mark(X)
active(sel(s(X), cons(Y, Z))) → mark(sel(X, Z))
active(indx(nil, X)) → mark(nil)
active(indx(cons(X, Y), Z)) → mark(cons(sel(X, Z), indx(Y, Z)))
active(from(X)) → mark(cons(X, from(s(X))))
active(dbl1(0)) → mark(01)
active(dbl1(s(X))) → mark(s1(s1(dbl1(X))))
active(sel1(0, cons(X, Y))) → mark(X)
active(sel1(s(X), cons(Y, Z))) → mark(sel1(X, Z))
active(quote(0)) → mark(01)
active(quote(s(X))) → mark(s1(quote(X)))
active(quote(dbl(X))) → mark(dbl1(X))
active(quote(sel(X, Y))) → mark(sel1(X, Y))
active(dbl(X)) → dbl(active(X))
active(dbls(X)) → dbls(active(X))
active(sel(X1, X2)) → sel(active(X1), X2)
active(sel(X1, X2)) → sel(X1, active(X2))
active(indx(X1, X2)) → indx(active(X1), X2)
active(dbl1(X)) → dbl1(active(X))
active(s1(X)) → s1(active(X))
active(sel1(X1, X2)) → sel1(active(X1), X2)
active(sel1(X1, X2)) → sel1(X1, active(X2))
active(quote(X)) → quote(active(X))
dbl(mark(X)) → mark(dbl(X))
dbls(mark(X)) → mark(dbls(X))
sel(mark(X1), X2) → mark(sel(X1, X2))
sel(X1, mark(X2)) → mark(sel(X1, X2))
indx(mark(X1), X2) → mark(indx(X1, X2))
dbl1(mark(X)) → mark(dbl1(X))
s1(mark(X)) → mark(s1(X))
sel1(mark(X1), X2) → mark(sel1(X1, X2))
sel1(X1, mark(X2)) → mark(sel1(X1, X2))
quote(mark(X)) → mark(quote(X))
proper(dbl(X)) → dbl(proper(X))
proper(0) → ok(0)
proper(s(X)) → s(proper(X))
proper(dbls(X)) → dbls(proper(X))
proper(nil) → ok(nil)
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(sel(X1, X2)) → sel(proper(X1), proper(X2))
proper(indx(X1, X2)) → indx(proper(X1), proper(X2))
proper(from(X)) → from(proper(X))
proper(dbl1(X)) → dbl1(proper(X))
proper(01) → ok(01)
proper(s1(X)) → s1(proper(X))
proper(sel1(X1, X2)) → sel1(proper(X1), proper(X2))
proper(quote(X)) → quote(proper(X))
dbl(ok(X)) → ok(dbl(X))
s(ok(X)) → ok(s(X))
dbls(ok(X)) → ok(dbls(X))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
sel(ok(X1), ok(X2)) → ok(sel(X1, X2))
indx(ok(X1), ok(X2)) → ok(indx(X1, X2))
from(ok(X)) → ok(from(X))
dbl1(ok(X)) → ok(dbl1(X))
s1(ok(X)) → ok(s1(X))
sel1(ok(X1), ok(X2)) → ok(sel1(X1, X2))
quote(ok(X)) → ok(quote(X))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The TRS P is empty. Hence, there is no (P,Q,R) chain.

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ EdgeDeletionProof

        ↳ QDP

          ↳ DependencyGraphProof

            ↳ AND

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

                ↳ QDPOrderProof

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

SEL1(mark(X1), X2) → SEL1(X1, X2)
SEL1(X1, mark(X2)) → SEL1(X1, X2)
SEL1(ok(X1), ok(X2)) → SEL1(X1, X2)

The TRS R consists of the following rules:

active(dbl(0)) → mark(0)
active(dbl(s(X))) → mark(s(s(dbl(X))))
active(dbls(nil)) → mark(nil)
active(dbls(cons(X, Y))) → mark(cons(dbl(X), dbls(Y)))
active(sel(0, cons(X, Y))) → mark(X)
active(sel(s(X), cons(Y, Z))) → mark(sel(X, Z))
active(indx(nil, X)) → mark(nil)
active(indx(cons(X, Y), Z)) → mark(cons(sel(X, Z), indx(Y, Z)))
active(from(X)) → mark(cons(X, from(s(X))))
active(dbl1(0)) → mark(01)
active(dbl1(s(X))) → mark(s1(s1(dbl1(X))))
active(sel1(0, cons(X, Y))) → mark(X)
active(sel1(s(X), cons(Y, Z))) → mark(sel1(X, Z))
active(quote(0)) → mark(01)
active(quote(s(X))) → mark(s1(quote(X)))
active(quote(dbl(X))) → mark(dbl1(X))
active(quote(sel(X, Y))) → mark(sel1(X, Y))
active(dbl(X)) → dbl(active(X))
active(dbls(X)) → dbls(active(X))
active(sel(X1, X2)) → sel(active(X1), X2)
active(sel(X1, X2)) → sel(X1, active(X2))
active(indx(X1, X2)) → indx(active(X1), X2)
active(dbl1(X)) → dbl1(active(X))
active(s1(X)) → s1(active(X))
active(sel1(X1, X2)) → sel1(active(X1), X2)
active(sel1(X1, X2)) → sel1(X1, active(X2))
active(quote(X)) → quote(active(X))
dbl(mark(X)) → mark(dbl(X))
dbls(mark(X)) → mark(dbls(X))
sel(mark(X1), X2) → mark(sel(X1, X2))
sel(X1, mark(X2)) → mark(sel(X1, X2))
indx(mark(X1), X2) → mark(indx(X1, X2))
dbl1(mark(X)) → mark(dbl1(X))
s1(mark(X)) → mark(s1(X))
sel1(mark(X1), X2) → mark(sel1(X1, X2))
sel1(X1, mark(X2)) → mark(sel1(X1, X2))
quote(mark(X)) → mark(quote(X))
proper(dbl(X)) → dbl(proper(X))
proper(0) → ok(0)
proper(s(X)) → s(proper(X))
proper(dbls(X)) → dbls(proper(X))
proper(nil) → ok(nil)
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(sel(X1, X2)) → sel(proper(X1), proper(X2))
proper(indx(X1, X2)) → indx(proper(X1), proper(X2))
proper(from(X)) → from(proper(X))
proper(dbl1(X)) → dbl1(proper(X))
proper(01) → ok(01)
proper(s1(X)) → s1(proper(X))
proper(sel1(X1, X2)) → sel1(proper(X1), proper(X2))
proper(quote(X)) → quote(proper(X))
dbl(ok(X)) → ok(dbl(X))
s(ok(X)) → ok(s(X))
dbls(ok(X)) → ok(dbls(X))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
sel(ok(X1), ok(X2)) → ok(sel(X1, X2))
indx(ok(X1), ok(X2)) → ok(indx(X1, X2))
from(ok(X)) → ok(from(X))
dbl1(ok(X)) → ok(dbl1(X))
s1(ok(X)) → ok(s1(X))
sel1(ok(X1), ok(X2)) → ok(sel1(X1, X2))
quote(ok(X)) → ok(quote(X))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].

The following pairs can be oriented strictly and are deleted.

SEL1(ok(X1), ok(X2)) → SEL1(X1, X2)

The remaining pairs can at least be oriented weakly.

SEL1(mark(X1), X2) → SEL1(X1, X2)
SEL1(X1, mark(X2)) → SEL1(X1, X2)

Used ordering: Combined order from the following AFS and order.
SEL1(x1, x2) = x2
mark(x1) = x1
ok(x1) = ok(x1)

Lexicographic Path Order [19].
Precedence:

trivial

The following usable rules [14] were oriented: none

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ EdgeDeletionProof

        ↳ QDP

          ↳ DependencyGraphProof

            ↳ AND

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

                ↳ QDPOrderProof

                  ↳ QDP

                    ↳ QDPOrderProof

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

SEL1(mark(X1), X2) → SEL1(X1, X2)
SEL1(X1, mark(X2)) → SEL1(X1, X2)

The TRS R consists of the following rules:

active(dbl(0)) → mark(0)
active(dbl(s(X))) → mark(s(s(dbl(X))))
active(dbls(nil)) → mark(nil)
active(dbls(cons(X, Y))) → mark(cons(dbl(X), dbls(Y)))
active(sel(0, cons(X, Y))) → mark(X)
active(sel(s(X), cons(Y, Z))) → mark(sel(X, Z))
active(indx(nil, X)) → mark(nil)
active(indx(cons(X, Y), Z)) → mark(cons(sel(X, Z), indx(Y, Z)))
active(from(X)) → mark(cons(X, from(s(X))))
active(dbl1(0)) → mark(01)
active(dbl1(s(X))) → mark(s1(s1(dbl1(X))))
active(sel1(0, cons(X, Y))) → mark(X)
active(sel1(s(X), cons(Y, Z))) → mark(sel1(X, Z))
active(quote(0)) → mark(01)
active(quote(s(X))) → mark(s1(quote(X)))
active(quote(dbl(X))) → mark(dbl1(X))
active(quote(sel(X, Y))) → mark(sel1(X, Y))
active(dbl(X)) → dbl(active(X))
active(dbls(X)) → dbls(active(X))
active(sel(X1, X2)) → sel(active(X1), X2)
active(sel(X1, X2)) → sel(X1, active(X2))
active(indx(X1, X2)) → indx(active(X1), X2)
active(dbl1(X)) → dbl1(active(X))
active(s1(X)) → s1(active(X))
active(sel1(X1, X2)) → sel1(active(X1), X2)
active(sel1(X1, X2)) → sel1(X1, active(X2))
active(quote(X)) → quote(active(X))
dbl(mark(X)) → mark(dbl(X))
dbls(mark(X)) → mark(dbls(X))
sel(mark(X1), X2) → mark(sel(X1, X2))
sel(X1, mark(X2)) → mark(sel(X1, X2))
indx(mark(X1), X2) → mark(indx(X1, X2))
dbl1(mark(X)) → mark(dbl1(X))
s1(mark(X)) → mark(s1(X))
sel1(mark(X1), X2) → mark(sel1(X1, X2))
sel1(X1, mark(X2)) → mark(sel1(X1, X2))
quote(mark(X)) → mark(quote(X))
proper(dbl(X)) → dbl(proper(X))
proper(0) → ok(0)
proper(s(X)) → s(proper(X))
proper(dbls(X)) → dbls(proper(X))
proper(nil) → ok(nil)
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(sel(X1, X2)) → sel(proper(X1), proper(X2))
proper(indx(X1, X2)) → indx(proper(X1), proper(X2))
proper(from(X)) → from(proper(X))
proper(dbl1(X)) → dbl1(proper(X))
proper(01) → ok(01)
proper(s1(X)) → s1(proper(X))
proper(sel1(X1, X2)) → sel1(proper(X1), proper(X2))
proper(quote(X)) → quote(proper(X))
dbl(ok(X)) → ok(dbl(X))
s(ok(X)) → ok(s(X))
dbls(ok(X)) → ok(dbls(X))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
sel(ok(X1), ok(X2)) → ok(sel(X1, X2))
indx(ok(X1), ok(X2)) → ok(indx(X1, X2))
from(ok(X)) → ok(from(X))
dbl1(ok(X)) → ok(dbl1(X))
s1(ok(X)) → ok(s1(X))
sel1(ok(X1), ok(X2)) → ok(sel1(X1, X2))
quote(ok(X)) → ok(quote(X))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].

The following pairs can be oriented strictly and are deleted.

SEL1(X1, mark(X2)) → SEL1(X1, X2)

The remaining pairs can at least be oriented weakly.

SEL1(mark(X1), X2) → SEL1(X1, X2)

Used ordering: Combined order from the following AFS and order.
SEL1(x1, x2) = x2
mark(x1) = mark(x1)

Lexicographic Path Order [19].
Precedence:

trivial

The following usable rules [14] were oriented: none

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ EdgeDeletionProof

        ↳ QDP

          ↳ DependencyGraphProof

            ↳ AND

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

                ↳ QDPOrderProof

                  ↳ QDP

                    ↳ QDPOrderProof

                      ↳ QDP

                        ↳ QDPOrderProof

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

SEL1(mark(X1), X2) → SEL1(X1, X2)

The TRS R consists of the following rules:

active(dbl(0)) → mark(0)
active(dbl(s(X))) → mark(s(s(dbl(X))))
active(dbls(nil)) → mark(nil)
active(dbls(cons(X, Y))) → mark(cons(dbl(X), dbls(Y)))
active(sel(0, cons(X, Y))) → mark(X)
active(sel(s(X), cons(Y, Z))) → mark(sel(X, Z))
active(indx(nil, X)) → mark(nil)
active(indx(cons(X, Y), Z)) → mark(cons(sel(X, Z), indx(Y, Z)))
active(from(X)) → mark(cons(X, from(s(X))))
active(dbl1(0)) → mark(01)
active(dbl1(s(X))) → mark(s1(s1(dbl1(X))))
active(sel1(0, cons(X, Y))) → mark(X)
active(sel1(s(X), cons(Y, Z))) → mark(sel1(X, Z))
active(quote(0)) → mark(01)
active(quote(s(X))) → mark(s1(quote(X)))
active(quote(dbl(X))) → mark(dbl1(X))
active(quote(sel(X, Y))) → mark(sel1(X, Y))
active(dbl(X)) → dbl(active(X))
active(dbls(X)) → dbls(active(X))
active(sel(X1, X2)) → sel(active(X1), X2)
active(sel(X1, X2)) → sel(X1, active(X2))
active(indx(X1, X2)) → indx(active(X1), X2)
active(dbl1(X)) → dbl1(active(X))
active(s1(X)) → s1(active(X))
active(sel1(X1, X2)) → sel1(active(X1), X2)
active(sel1(X1, X2)) → sel1(X1, active(X2))
active(quote(X)) → quote(active(X))
dbl(mark(X)) → mark(dbl(X))
dbls(mark(X)) → mark(dbls(X))
sel(mark(X1), X2) → mark(sel(X1, X2))
sel(X1, mark(X2)) → mark(sel(X1, X2))
indx(mark(X1), X2) → mark(indx(X1, X2))
dbl1(mark(X)) → mark(dbl1(X))
s1(mark(X)) → mark(s1(X))
sel1(mark(X1), X2) → mark(sel1(X1, X2))
sel1(X1, mark(X2)) → mark(sel1(X1, X2))
quote(mark(X)) → mark(quote(X))
proper(dbl(X)) → dbl(proper(X))
proper(0) → ok(0)
proper(s(X)) → s(proper(X))
proper(dbls(X)) → dbls(proper(X))
proper(nil) → ok(nil)
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(sel(X1, X2)) → sel(proper(X1), proper(X2))
proper(indx(X1, X2)) → indx(proper(X1), proper(X2))
proper(from(X)) → from(proper(X))
proper(dbl1(X)) → dbl1(proper(X))
proper(01) → ok(01)
proper(s1(X)) → s1(proper(X))
proper(sel1(X1, X2)) → sel1(proper(X1), proper(X2))
proper(quote(X)) → quote(proper(X))
dbl(ok(X)) → ok(dbl(X))
s(ok(X)) → ok(s(X))
dbls(ok(X)) → ok(dbls(X))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
sel(ok(X1), ok(X2)) → ok(sel(X1, X2))
indx(ok(X1), ok(X2)) → ok(indx(X1, X2))
from(ok(X)) → ok(from(X))
dbl1(ok(X)) → ok(dbl1(X))
s1(ok(X)) → ok(s1(X))
sel1(ok(X1), ok(X2)) → ok(sel1(X1, X2))
quote(ok(X)) → ok(quote(X))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].

The following pairs can be oriented strictly and are deleted.

SEL1(mark(X1), X2) → SEL1(X1, X2)

The remaining pairs can at least be oriented weakly.
none
Used ordering: Combined order from the following AFS and order.
SEL1(x1, x2) = x1
mark(x1) = mark(x1)

Lexicographic Path Order [19].
Precedence:

trivial

The following usable rules [14] were oriented: none

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ EdgeDeletionProof

        ↳ QDP

          ↳ DependencyGraphProof

            ↳ AND

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

                ↳ QDPOrderProof

                  ↳ QDP

                    ↳ QDPOrderProof

                      ↳ QDP

                        ↳ QDPOrderProof

                          ↳ QDP

                            ↳ PisEmptyProof

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

Q DP problem:
P is empty.
The TRS R consists of the following rules:

active(dbl(0)) → mark(0)
active(dbl(s(X))) → mark(s(s(dbl(X))))
active(dbls(nil)) → mark(nil)
active(dbls(cons(X, Y))) → mark(cons(dbl(X), dbls(Y)))
active(sel(0, cons(X, Y))) → mark(X)
active(sel(s(X), cons(Y, Z))) → mark(sel(X, Z))
active(indx(nil, X)) → mark(nil)
active(indx(cons(X, Y), Z)) → mark(cons(sel(X, Z), indx(Y, Z)))
active(from(X)) → mark(cons(X, from(s(X))))
active(dbl1(0)) → mark(01)
active(dbl1(s(X))) → mark(s1(s1(dbl1(X))))
active(sel1(0, cons(X, Y))) → mark(X)
active(sel1(s(X), cons(Y, Z))) → mark(sel1(X, Z))
active(quote(0)) → mark(01)
active(quote(s(X))) → mark(s1(quote(X)))
active(quote(dbl(X))) → mark(dbl1(X))
active(quote(sel(X, Y))) → mark(sel1(X, Y))
active(dbl(X)) → dbl(active(X))
active(dbls(X)) → dbls(active(X))
active(sel(X1, X2)) → sel(active(X1), X2)
active(sel(X1, X2)) → sel(X1, active(X2))
active(indx(X1, X2)) → indx(active(X1), X2)
active(dbl1(X)) → dbl1(active(X))
active(s1(X)) → s1(active(X))
active(sel1(X1, X2)) → sel1(active(X1), X2)
active(sel1(X1, X2)) → sel1(X1, active(X2))
active(quote(X)) → quote(active(X))
dbl(mark(X)) → mark(dbl(X))
dbls(mark(X)) → mark(dbls(X))
sel(mark(X1), X2) → mark(sel(X1, X2))
sel(X1, mark(X2)) → mark(sel(X1, X2))
indx(mark(X1), X2) → mark(indx(X1, X2))
dbl1(mark(X)) → mark(dbl1(X))
s1(mark(X)) → mark(s1(X))
sel1(mark(X1), X2) → mark(sel1(X1, X2))
sel1(X1, mark(X2)) → mark(sel1(X1, X2))
quote(mark(X)) → mark(quote(X))
proper(dbl(X)) → dbl(proper(X))
proper(0) → ok(0)
proper(s(X)) → s(proper(X))
proper(dbls(X)) → dbls(proper(X))
proper(nil) → ok(nil)
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(sel(X1, X2)) → sel(proper(X1), proper(X2))
proper(indx(X1, X2)) → indx(proper(X1), proper(X2))
proper(from(X)) → from(proper(X))
proper(dbl1(X)) → dbl1(proper(X))
proper(01) → ok(01)
proper(s1(X)) → s1(proper(X))
proper(sel1(X1, X2)) → sel1(proper(X1), proper(X2))
proper(quote(X)) → quote(proper(X))
dbl(ok(X)) → ok(dbl(X))
s(ok(X)) → ok(s(X))
dbls(ok(X)) → ok(dbls(X))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
sel(ok(X1), ok(X2)) → ok(sel(X1, X2))
indx(ok(X1), ok(X2)) → ok(indx(X1, X2))
from(ok(X)) → ok(from(X))
dbl1(ok(X)) → ok(dbl1(X))
s1(ok(X)) → ok(s1(X))
sel1(ok(X1), ok(X2)) → ok(sel1(X1, X2))
quote(ok(X)) → ok(quote(X))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The TRS P is empty. Hence, there is no (P,Q,R) chain.

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ EdgeDeletionProof

        ↳ QDP

          ↳ DependencyGraphProof

            ↳ AND

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

                ↳ QDPOrderProof

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

S1(mark(X)) → S1(X)
S1(ok(X)) → S1(X)

The TRS R consists of the following rules:

active(dbl(0)) → mark(0)
active(dbl(s(X))) → mark(s(s(dbl(X))))
active(dbls(nil)) → mark(nil)
active(dbls(cons(X, Y))) → mark(cons(dbl(X), dbls(Y)))
active(sel(0, cons(X, Y))) → mark(X)
active(sel(s(X), cons(Y, Z))) → mark(sel(X, Z))
active(indx(nil, X)) → mark(nil)
active(indx(cons(X, Y), Z)) → mark(cons(sel(X, Z), indx(Y, Z)))
active(from(X)) → mark(cons(X, from(s(X))))
active(dbl1(0)) → mark(01)
active(dbl1(s(X))) → mark(s1(s1(dbl1(X))))
active(sel1(0, cons(X, Y))) → mark(X)
active(sel1(s(X), cons(Y, Z))) → mark(sel1(X, Z))
active(quote(0)) → mark(01)
active(quote(s(X))) → mark(s1(quote(X)))
active(quote(dbl(X))) → mark(dbl1(X))
active(quote(sel(X, Y))) → mark(sel1(X, Y))
active(dbl(X)) → dbl(active(X))
active(dbls(X)) → dbls(active(X))
active(sel(X1, X2)) → sel(active(X1), X2)
active(sel(X1, X2)) → sel(X1, active(X2))
active(indx(X1, X2)) → indx(active(X1), X2)
active(dbl1(X)) → dbl1(active(X))
active(s1(X)) → s1(active(X))
active(sel1(X1, X2)) → sel1(active(X1), X2)
active(sel1(X1, X2)) → sel1(X1, active(X2))
active(quote(X)) → quote(active(X))
dbl(mark(X)) → mark(dbl(X))
dbls(mark(X)) → mark(dbls(X))
sel(mark(X1), X2) → mark(sel(X1, X2))
sel(X1, mark(X2)) → mark(sel(X1, X2))
indx(mark(X1), X2) → mark(indx(X1, X2))
dbl1(mark(X)) → mark(dbl1(X))
s1(mark(X)) → mark(s1(X))
sel1(mark(X1), X2) → mark(sel1(X1, X2))
sel1(X1, mark(X2)) → mark(sel1(X1, X2))
quote(mark(X)) → mark(quote(X))
proper(dbl(X)) → dbl(proper(X))
proper(0) → ok(0)
proper(s(X)) → s(proper(X))
proper(dbls(X)) → dbls(proper(X))
proper(nil) → ok(nil)
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(sel(X1, X2)) → sel(proper(X1), proper(X2))
proper(indx(X1, X2)) → indx(proper(X1), proper(X2))
proper(from(X)) → from(proper(X))
proper(dbl1(X)) → dbl1(proper(X))
proper(01) → ok(01)
proper(s1(X)) → s1(proper(X))
proper(sel1(X1, X2)) → sel1(proper(X1), proper(X2))
proper(quote(X)) → quote(proper(X))
dbl(ok(X)) → ok(dbl(X))
s(ok(X)) → ok(s(X))
dbls(ok(X)) → ok(dbls(X))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
sel(ok(X1), ok(X2)) → ok(sel(X1, X2))
indx(ok(X1), ok(X2)) → ok(indx(X1, X2))
from(ok(X)) → ok(from(X))
dbl1(ok(X)) → ok(dbl1(X))
s1(ok(X)) → ok(s1(X))
sel1(ok(X1), ok(X2)) → ok(sel1(X1, X2))
quote(ok(X)) → ok(quote(X))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].

The following pairs can be oriented strictly and are deleted.

S1(ok(X)) → S1(X)

The remaining pairs can at least be oriented weakly.

S1(mark(X)) → S1(X)

Used ordering: Combined order from the following AFS and order.
S1(x1) = x1
mark(x1) = x1
ok(x1) = ok(x1)

Lexicographic Path Order [19].
Precedence:

trivial

The following usable rules [14] were oriented: none

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ EdgeDeletionProof

        ↳ QDP

          ↳ DependencyGraphProof

            ↳ AND

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

                ↳ QDPOrderProof

                  ↳ QDP

                    ↳ QDPOrderProof

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

S1(mark(X)) → S1(X)

The TRS R consists of the following rules:

active(dbl(0)) → mark(0)
active(dbl(s(X))) → mark(s(s(dbl(X))))
active(dbls(nil)) → mark(nil)
active(dbls(cons(X, Y))) → mark(cons(dbl(X), dbls(Y)))
active(sel(0, cons(X, Y))) → mark(X)
active(sel(s(X), cons(Y, Z))) → mark(sel(X, Z))
active(indx(nil, X)) → mark(nil)
active(indx(cons(X, Y), Z)) → mark(cons(sel(X, Z), indx(Y, Z)))
active(from(X)) → mark(cons(X, from(s(X))))
active(dbl1(0)) → mark(01)
active(dbl1(s(X))) → mark(s1(s1(dbl1(X))))
active(sel1(0, cons(X, Y))) → mark(X)
active(sel1(s(X), cons(Y, Z))) → mark(sel1(X, Z))
active(quote(0)) → mark(01)
active(quote(s(X))) → mark(s1(quote(X)))
active(quote(dbl(X))) → mark(dbl1(X))
active(quote(sel(X, Y))) → mark(sel1(X, Y))
active(dbl(X)) → dbl(active(X))
active(dbls(X)) → dbls(active(X))
active(sel(X1, X2)) → sel(active(X1), X2)
active(sel(X1, X2)) → sel(X1, active(X2))
active(indx(X1, X2)) → indx(active(X1), X2)
active(dbl1(X)) → dbl1(active(X))
active(s1(X)) → s1(active(X))
active(sel1(X1, X2)) → sel1(active(X1), X2)
active(sel1(X1, X2)) → sel1(X1, active(X2))
active(quote(X)) → quote(active(X))
dbl(mark(X)) → mark(dbl(X))
dbls(mark(X)) → mark(dbls(X))
sel(mark(X1), X2) → mark(sel(X1, X2))
sel(X1, mark(X2)) → mark(sel(X1, X2))
indx(mark(X1), X2) → mark(indx(X1, X2))
dbl1(mark(X)) → mark(dbl1(X))
s1(mark(X)) → mark(s1(X))
sel1(mark(X1), X2) → mark(sel1(X1, X2))
sel1(X1, mark(X2)) → mark(sel1(X1, X2))
quote(mark(X)) → mark(quote(X))
proper(dbl(X)) → dbl(proper(X))
proper(0) → ok(0)
proper(s(X)) → s(proper(X))
proper(dbls(X)) → dbls(proper(X))
proper(nil) → ok(nil)
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(sel(X1, X2)) → sel(proper(X1), proper(X2))
proper(indx(X1, X2)) → indx(proper(X1), proper(X2))
proper(from(X)) → from(proper(X))
proper(dbl1(X)) → dbl1(proper(X))
proper(01) → ok(01)
proper(s1(X)) → s1(proper(X))
proper(sel1(X1, X2)) → sel1(proper(X1), proper(X2))
proper(quote(X)) → quote(proper(X))
dbl(ok(X)) → ok(dbl(X))
s(ok(X)) → ok(s(X))
dbls(ok(X)) → ok(dbls(X))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
sel(ok(X1), ok(X2)) → ok(sel(X1, X2))
indx(ok(X1), ok(X2)) → ok(indx(X1, X2))
from(ok(X)) → ok(from(X))
dbl1(ok(X)) → ok(dbl1(X))
s1(ok(X)) → ok(s1(X))
sel1(ok(X1), ok(X2)) → ok(sel1(X1, X2))
quote(ok(X)) → ok(quote(X))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].

The following pairs can be oriented strictly and are deleted.

S1(mark(X)) → S1(X)

The remaining pairs can at least be oriented weakly.
none
Used ordering: Combined order from the following AFS and order.
S1(x1) = x1
mark(x1) = mark(x1)

Lexicographic Path Order [19].
Precedence:

trivial

The following usable rules [14] were oriented: none

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ EdgeDeletionProof

        ↳ QDP

          ↳ DependencyGraphProof

            ↳ AND

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

                ↳ QDPOrderProof

                  ↳ QDP

                    ↳ QDPOrderProof

                      ↳ QDP

                        ↳ PisEmptyProof

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

Q DP problem:
P is empty.
The TRS R consists of the following rules:

active(dbl(0)) → mark(0)
active(dbl(s(X))) → mark(s(s(dbl(X))))
active(dbls(nil)) → mark(nil)
active(dbls(cons(X, Y))) → mark(cons(dbl(X), dbls(Y)))
active(sel(0, cons(X, Y))) → mark(X)
active(sel(s(X), cons(Y, Z))) → mark(sel(X, Z))
active(indx(nil, X)) → mark(nil)
active(indx(cons(X, Y), Z)) → mark(cons(sel(X, Z), indx(Y, Z)))
active(from(X)) → mark(cons(X, from(s(X))))
active(dbl1(0)) → mark(01)
active(dbl1(s(X))) → mark(s1(s1(dbl1(X))))
active(sel1(0, cons(X, Y))) → mark(X)
active(sel1(s(X), cons(Y, Z))) → mark(sel1(X, Z))
active(quote(0)) → mark(01)
active(quote(s(X))) → mark(s1(quote(X)))
active(quote(dbl(X))) → mark(dbl1(X))
active(quote(sel(X, Y))) → mark(sel1(X, Y))
active(dbl(X)) → dbl(active(X))
active(dbls(X)) → dbls(active(X))
active(sel(X1, X2)) → sel(active(X1), X2)
active(sel(X1, X2)) → sel(X1, active(X2))
active(indx(X1, X2)) → indx(active(X1), X2)
active(dbl1(X)) → dbl1(active(X))
active(s1(X)) → s1(active(X))
active(sel1(X1, X2)) → sel1(active(X1), X2)
active(sel1(X1, X2)) → sel1(X1, active(X2))
active(quote(X)) → quote(active(X))
dbl(mark(X)) → mark(dbl(X))
dbls(mark(X)) → mark(dbls(X))
sel(mark(X1), X2) → mark(sel(X1, X2))
sel(X1, mark(X2)) → mark(sel(X1, X2))
indx(mark(X1), X2) → mark(indx(X1, X2))
dbl1(mark(X)) → mark(dbl1(X))
s1(mark(X)) → mark(s1(X))
sel1(mark(X1), X2) → mark(sel1(X1, X2))
sel1(X1, mark(X2)) → mark(sel1(X1, X2))
quote(mark(X)) → mark(quote(X))
proper(dbl(X)) → dbl(proper(X))
proper(0) → ok(0)
proper(s(X)) → s(proper(X))
proper(dbls(X)) → dbls(proper(X))
proper(nil) → ok(nil)
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(sel(X1, X2)) → sel(proper(X1), proper(X2))
proper(indx(X1, X2)) → indx(proper(X1), proper(X2))
proper(from(X)) → from(proper(X))
proper(dbl1(X)) → dbl1(proper(X))
proper(01) → ok(01)
proper(s1(X)) → s1(proper(X))
proper(sel1(X1, X2)) → sel1(proper(X1), proper(X2))
proper(quote(X)) → quote(proper(X))
dbl(ok(X)) → ok(dbl(X))
s(ok(X)) → ok(s(X))
dbls(ok(X)) → ok(dbls(X))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
sel(ok(X1), ok(X2)) → ok(sel(X1, X2))
indx(ok(X1), ok(X2)) → ok(indx(X1, X2))
from(ok(X)) → ok(from(X))
dbl1(ok(X)) → ok(dbl1(X))
s1(ok(X)) → ok(s1(X))
sel1(ok(X1), ok(X2)) → ok(sel1(X1, X2))
quote(ok(X)) → ok(quote(X))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The TRS P is empty. Hence, there is no (P,Q,R) chain.

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ EdgeDeletionProof

        ↳ QDP

          ↳ DependencyGraphProof

            ↳ AND

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

                ↳ QDPOrderProof

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

DBL1(ok(X)) → DBL1(X)
DBL1(mark(X)) → DBL1(X)

The TRS R consists of the following rules:

active(dbl(0)) → mark(0)
active(dbl(s(X))) → mark(s(s(dbl(X))))
active(dbls(nil)) → mark(nil)
active(dbls(cons(X, Y))) → mark(cons(dbl(X), dbls(Y)))
active(sel(0, cons(X, Y))) → mark(X)
active(sel(s(X), cons(Y, Z))) → mark(sel(X, Z))
active(indx(nil, X)) → mark(nil)
active(indx(cons(X, Y), Z)) → mark(cons(sel(X, Z), indx(Y, Z)))
active(from(X)) → mark(cons(X, from(s(X))))
active(dbl1(0)) → mark(01)
active(dbl1(s(X))) → mark(s1(s1(dbl1(X))))
active(sel1(0, cons(X, Y))) → mark(X)
active(sel1(s(X), cons(Y, Z))) → mark(sel1(X, Z))
active(quote(0)) → mark(01)
active(quote(s(X))) → mark(s1(quote(X)))
active(quote(dbl(X))) → mark(dbl1(X))
active(quote(sel(X, Y))) → mark(sel1(X, Y))
active(dbl(X)) → dbl(active(X))
active(dbls(X)) → dbls(active(X))
active(sel(X1, X2)) → sel(active(X1), X2)
active(sel(X1, X2)) → sel(X1, active(X2))
active(indx(X1, X2)) → indx(active(X1), X2)
active(dbl1(X)) → dbl1(active(X))
active(s1(X)) → s1(active(X))
active(sel1(X1, X2)) → sel1(active(X1), X2)
active(sel1(X1, X2)) → sel1(X1, active(X2))
active(quote(X)) → quote(active(X))
dbl(mark(X)) → mark(dbl(X))
dbls(mark(X)) → mark(dbls(X))
sel(mark(X1), X2) → mark(sel(X1, X2))
sel(X1, mark(X2)) → mark(sel(X1, X2))
indx(mark(X1), X2) → mark(indx(X1, X2))
dbl1(mark(X)) → mark(dbl1(X))
s1(mark(X)) → mark(s1(X))
sel1(mark(X1), X2) → mark(sel1(X1, X2))
sel1(X1, mark(X2)) → mark(sel1(X1, X2))
quote(mark(X)) → mark(quote(X))
proper(dbl(X)) → dbl(proper(X))
proper(0) → ok(0)
proper(s(X)) → s(proper(X))
proper(dbls(X)) → dbls(proper(X))
proper(nil) → ok(nil)
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(sel(X1, X2)) → sel(proper(X1), proper(X2))
proper(indx(X1, X2)) → indx(proper(X1), proper(X2))
proper(from(X)) → from(proper(X))
proper(dbl1(X)) → dbl1(proper(X))
proper(01) → ok(01)
proper(s1(X)) → s1(proper(X))
proper(sel1(X1, X2)) → sel1(proper(X1), proper(X2))
proper(quote(X)) → quote(proper(X))
dbl(ok(X)) → ok(dbl(X))
s(ok(X)) → ok(s(X))
dbls(ok(X)) → ok(dbls(X))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
sel(ok(X1), ok(X2)) → ok(sel(X1, X2))
indx(ok(X1), ok(X2)) → ok(indx(X1, X2))
from(ok(X)) → ok(from(X))
dbl1(ok(X)) → ok(dbl1(X))
s1(ok(X)) → ok(s1(X))
sel1(ok(X1), ok(X2)) → ok(sel1(X1, X2))
quote(ok(X)) → ok(quote(X))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].

The following pairs can be oriented strictly and are deleted.

DBL1(mark(X)) → DBL1(X)

The remaining pairs can at least be oriented weakly.

DBL1(ok(X)) → DBL1(X)

Used ordering: Combined order from the following AFS and order.
DBL1(x1) = x1
ok(x1) = x1
mark(x1) = mark(x1)

Lexicographic Path Order [19].
Precedence:

trivial

The following usable rules [14] were oriented: none

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ EdgeDeletionProof

        ↳ QDP

          ↳ DependencyGraphProof

            ↳ AND

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

                ↳ QDPOrderProof

                  ↳ QDP

                    ↳ QDPOrderProof

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

DBL1(ok(X)) → DBL1(X)

The TRS R consists of the following rules:

active(dbl(0)) → mark(0)
active(dbl(s(X))) → mark(s(s(dbl(X))))
active(dbls(nil)) → mark(nil)
active(dbls(cons(X, Y))) → mark(cons(dbl(X), dbls(Y)))
active(sel(0, cons(X, Y))) → mark(X)
active(sel(s(X), cons(Y, Z))) → mark(sel(X, Z))
active(indx(nil, X)) → mark(nil)
active(indx(cons(X, Y), Z)) → mark(cons(sel(X, Z), indx(Y, Z)))
active(from(X)) → mark(cons(X, from(s(X))))
active(dbl1(0)) → mark(01)
active(dbl1(s(X))) → mark(s1(s1(dbl1(X))))
active(sel1(0, cons(X, Y))) → mark(X)
active(sel1(s(X), cons(Y, Z))) → mark(sel1(X, Z))
active(quote(0)) → mark(01)
active(quote(s(X))) → mark(s1(quote(X)))
active(quote(dbl(X))) → mark(dbl1(X))
active(quote(sel(X, Y))) → mark(sel1(X, Y))
active(dbl(X)) → dbl(active(X))
active(dbls(X)) → dbls(active(X))
active(sel(X1, X2)) → sel(active(X1), X2)
active(sel(X1, X2)) → sel(X1, active(X2))
active(indx(X1, X2)) → indx(active(X1), X2)
active(dbl1(X)) → dbl1(active(X))
active(s1(X)) → s1(active(X))
active(sel1(X1, X2)) → sel1(active(X1), X2)
active(sel1(X1, X2)) → sel1(X1, active(X2))
active(quote(X)) → quote(active(X))
dbl(mark(X)) → mark(dbl(X))
dbls(mark(X)) → mark(dbls(X))
sel(mark(X1), X2) → mark(sel(X1, X2))
sel(X1, mark(X2)) → mark(sel(X1, X2))
indx(mark(X1), X2) → mark(indx(X1, X2))
dbl1(mark(X)) → mark(dbl1(X))
s1(mark(X)) → mark(s1(X))
sel1(mark(X1), X2) → mark(sel1(X1, X2))
sel1(X1, mark(X2)) → mark(sel1(X1, X2))
quote(mark(X)) → mark(quote(X))
proper(dbl(X)) → dbl(proper(X))
proper(0) → ok(0)
proper(s(X)) → s(proper(X))
proper(dbls(X)) → dbls(proper(X))
proper(nil) → ok(nil)
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(sel(X1, X2)) → sel(proper(X1), proper(X2))
proper(indx(X1, X2)) → indx(proper(X1), proper(X2))
proper(from(X)) → from(proper(X))
proper(dbl1(X)) → dbl1(proper(X))
proper(01) → ok(01)
proper(s1(X)) → s1(proper(X))
proper(sel1(X1, X2)) → sel1(proper(X1), proper(X2))
proper(quote(X)) → quote(proper(X))
dbl(ok(X)) → ok(dbl(X))
s(ok(X)) → ok(s(X))
dbls(ok(X)) → ok(dbls(X))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
sel(ok(X1), ok(X2)) → ok(sel(X1, X2))
indx(ok(X1), ok(X2)) → ok(indx(X1, X2))
from(ok(X)) → ok(from(X))
dbl1(ok(X)) → ok(dbl1(X))
s1(ok(X)) → ok(s1(X))
sel1(ok(X1), ok(X2)) → ok(sel1(X1, X2))
quote(ok(X)) → ok(quote(X))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].

The following pairs can be oriented strictly and are deleted.

DBL1(ok(X)) → DBL1(X)

The remaining pairs can at least be oriented weakly.
none
Used ordering: Combined order from the following AFS and order.
DBL1(x1) = x1
ok(x1) = ok(x1)

Lexicographic Path Order [19].
Precedence:

trivial

The following usable rules [14] were oriented: none

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ EdgeDeletionProof

        ↳ QDP

          ↳ DependencyGraphProof

            ↳ AND

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

                ↳ QDPOrderProof

                  ↳ QDP

                    ↳ QDPOrderProof

                      ↳ QDP

                        ↳ PisEmptyProof

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

Q DP problem:
P is empty.
The TRS R consists of the following rules:

active(dbl(0)) → mark(0)
active(dbl(s(X))) → mark(s(s(dbl(X))))
active(dbls(nil)) → mark(nil)
active(dbls(cons(X, Y))) → mark(cons(dbl(X), dbls(Y)))
active(sel(0, cons(X, Y))) → mark(X)
active(sel(s(X), cons(Y, Z))) → mark(sel(X, Z))
active(indx(nil, X)) → mark(nil)
active(indx(cons(X, Y), Z)) → mark(cons(sel(X, Z), indx(Y, Z)))
active(from(X)) → mark(cons(X, from(s(X))))
active(dbl1(0)) → mark(01)
active(dbl1(s(X))) → mark(s1(s1(dbl1(X))))
active(sel1(0, cons(X, Y))) → mark(X)
active(sel1(s(X), cons(Y, Z))) → mark(sel1(X, Z))
active(quote(0)) → mark(01)
active(quote(s(X))) → mark(s1(quote(X)))
active(quote(dbl(X))) → mark(dbl1(X))
active(quote(sel(X, Y))) → mark(sel1(X, Y))
active(dbl(X)) → dbl(active(X))
active(dbls(X)) → dbls(active(X))
active(sel(X1, X2)) → sel(active(X1), X2)
active(sel(X1, X2)) → sel(X1, active(X2))
active(indx(X1, X2)) → indx(active(X1), X2)
active(dbl1(X)) → dbl1(active(X))
active(s1(X)) → s1(active(X))
active(sel1(X1, X2)) → sel1(active(X1), X2)
active(sel1(X1, X2)) → sel1(X1, active(X2))
active(quote(X)) → quote(active(X))
dbl(mark(X)) → mark(dbl(X))
dbls(mark(X)) → mark(dbls(X))
sel(mark(X1), X2) → mark(sel(X1, X2))
sel(X1, mark(X2)) → mark(sel(X1, X2))
indx(mark(X1), X2) → mark(indx(X1, X2))
dbl1(mark(X)) → mark(dbl1(X))
s1(mark(X)) → mark(s1(X))
sel1(mark(X1), X2) → mark(sel1(X1, X2))
sel1(X1, mark(X2)) → mark(sel1(X1, X2))
quote(mark(X)) → mark(quote(X))
proper(dbl(X)) → dbl(proper(X))
proper(0) → ok(0)
proper(s(X)) → s(proper(X))
proper(dbls(X)) → dbls(proper(X))
proper(nil) → ok(nil)
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(sel(X1, X2)) → sel(proper(X1), proper(X2))
proper(indx(X1, X2)) → indx(proper(X1), proper(X2))
proper(from(X)) → from(proper(X))
proper(dbl1(X)) → dbl1(proper(X))
proper(01) → ok(01)
proper(s1(X)) → s1(proper(X))
proper(sel1(X1, X2)) → sel1(proper(X1), proper(X2))
proper(quote(X)) → quote(proper(X))
dbl(ok(X)) → ok(dbl(X))
s(ok(X)) → ok(s(X))
dbls(ok(X)) → ok(dbls(X))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
sel(ok(X1), ok(X2)) → ok(sel(X1, X2))
indx(ok(X1), ok(X2)) → ok(indx(X1, X2))
from(ok(X)) → ok(from(X))
dbl1(ok(X)) → ok(dbl1(X))
s1(ok(X)) → ok(s1(X))
sel1(ok(X1), ok(X2)) → ok(sel1(X1, X2))
quote(ok(X)) → ok(quote(X))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The TRS P is empty. Hence, there is no (P,Q,R) chain.

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ EdgeDeletionProof

        ↳ QDP

          ↳ DependencyGraphProof

            ↳ AND

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

                ↳ QDPOrderProof

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

INDX(ok(X1), ok(X2)) → INDX(X1, X2)
INDX(mark(X1), X2) → INDX(X1, X2)

The TRS R consists of the following rules:

active(dbl(0)) → mark(0)
active(dbl(s(X))) → mark(s(s(dbl(X))))
active(dbls(nil)) → mark(nil)
active(dbls(cons(X, Y))) → mark(cons(dbl(X), dbls(Y)))
active(sel(0, cons(X, Y))) → mark(X)
active(sel(s(X), cons(Y, Z))) → mark(sel(X, Z))
active(indx(nil, X)) → mark(nil)
active(indx(cons(X, Y), Z)) → mark(cons(sel(X, Z), indx(Y, Z)))
active(from(X)) → mark(cons(X, from(s(X))))
active(dbl1(0)) → mark(01)
active(dbl1(s(X))) → mark(s1(s1(dbl1(X))))
active(sel1(0, cons(X, Y))) → mark(X)
active(sel1(s(X), cons(Y, Z))) → mark(sel1(X, Z))
active(quote(0)) → mark(01)
active(quote(s(X))) → mark(s1(quote(X)))
active(quote(dbl(X))) → mark(dbl1(X))
active(quote(sel(X, Y))) → mark(sel1(X, Y))
active(dbl(X)) → dbl(active(X))
active(dbls(X)) → dbls(active(X))
active(sel(X1, X2)) → sel(active(X1), X2)
active(sel(X1, X2)) → sel(X1, active(X2))
active(indx(X1, X2)) → indx(active(X1), X2)
active(dbl1(X)) → dbl1(active(X))
active(s1(X)) → s1(active(X))
active(sel1(X1, X2)) → sel1(active(X1), X2)
active(sel1(X1, X2)) → sel1(X1, active(X2))
active(quote(X)) → quote(active(X))
dbl(mark(X)) → mark(dbl(X))
dbls(mark(X)) → mark(dbls(X))
sel(mark(X1), X2) → mark(sel(X1, X2))
sel(X1, mark(X2)) → mark(sel(X1, X2))
indx(mark(X1), X2) → mark(indx(X1, X2))
dbl1(mark(X)) → mark(dbl1(X))
s1(mark(X)) → mark(s1(X))
sel1(mark(X1), X2) → mark(sel1(X1, X2))
sel1(X1, mark(X2)) → mark(sel1(X1, X2))
quote(mark(X)) → mark(quote(X))
proper(dbl(X)) → dbl(proper(X))
proper(0) → ok(0)
proper(s(X)) → s(proper(X))
proper(dbls(X)) → dbls(proper(X))
proper(nil) → ok(nil)
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(sel(X1, X2)) → sel(proper(X1), proper(X2))
proper(indx(X1, X2)) → indx(proper(X1), proper(X2))
proper(from(X)) → from(proper(X))
proper(dbl1(X)) → dbl1(proper(X))
proper(01) → ok(01)
proper(s1(X)) → s1(proper(X))
proper(sel1(X1, X2)) → sel1(proper(X1), proper(X2))
proper(quote(X)) → quote(proper(X))
dbl(ok(X)) → ok(dbl(X))
s(ok(X)) → ok(s(X))
dbls(ok(X)) → ok(dbls(X))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
sel(ok(X1), ok(X2)) → ok(sel(X1, X2))
indx(ok(X1), ok(X2)) → ok(indx(X1, X2))
from(ok(X)) → ok(from(X))
dbl1(ok(X)) → ok(dbl1(X))
s1(ok(X)) → ok(s1(X))
sel1(ok(X1), ok(X2)) → ok(sel1(X1, X2))
quote(ok(X)) → ok(quote(X))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].

The following pairs can be oriented strictly and are deleted.

INDX(ok(X1), ok(X2)) → INDX(X1, X2)

The remaining pairs can at least be oriented weakly.

INDX(mark(X1), X2) → INDX(X1, X2)

Used ordering: Combined order from the following AFS and order.
INDX(x1, x2) = x2
ok(x1) = ok(x1)

Lexicographic Path Order [19].
Precedence:

trivial

The following usable rules [14] were oriented: none

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ EdgeDeletionProof

        ↳ QDP

          ↳ DependencyGraphProof

            ↳ AND

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

                ↳ QDPOrderProof

                  ↳ QDP

                    ↳ QDPOrderProof

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

INDX(mark(X1), X2) → INDX(X1, X2)

The TRS R consists of the following rules:

active(dbl(0)) → mark(0)
active(dbl(s(X))) → mark(s(s(dbl(X))))
active(dbls(nil)) → mark(nil)
active(dbls(cons(X, Y))) → mark(cons(dbl(X), dbls(Y)))
active(sel(0, cons(X, Y))) → mark(X)
active(sel(s(X), cons(Y, Z))) → mark(sel(X, Z))
active(indx(nil, X)) → mark(nil)
active(indx(cons(X, Y), Z)) → mark(cons(sel(X, Z), indx(Y, Z)))
active(from(X)) → mark(cons(X, from(s(X))))
active(dbl1(0)) → mark(01)
active(dbl1(s(X))) → mark(s1(s1(dbl1(X))))
active(sel1(0, cons(X, Y))) → mark(X)
active(sel1(s(X), cons(Y, Z))) → mark(sel1(X, Z))
active(quote(0)) → mark(01)
active(quote(s(X))) → mark(s1(quote(X)))
active(quote(dbl(X))) → mark(dbl1(X))
active(quote(sel(X, Y))) → mark(sel1(X, Y))
active(dbl(X)) → dbl(active(X))
active(dbls(X)) → dbls(active(X))
active(sel(X1, X2)) → sel(active(X1), X2)
active(sel(X1, X2)) → sel(X1, active(X2))
active(indx(X1, X2)) → indx(active(X1), X2)
active(dbl1(X)) → dbl1(active(X))
active(s1(X)) → s1(active(X))
active(sel1(X1, X2)) → sel1(active(X1), X2)
active(sel1(X1, X2)) → sel1(X1, active(X2))
active(quote(X)) → quote(active(X))
dbl(mark(X)) → mark(dbl(X))
dbls(mark(X)) → mark(dbls(X))
sel(mark(X1), X2) → mark(sel(X1, X2))
sel(X1, mark(X2)) → mark(sel(X1, X2))
indx(mark(X1), X2) → mark(indx(X1, X2))
dbl1(mark(X)) → mark(dbl1(X))
s1(mark(X)) → mark(s1(X))
sel1(mark(X1), X2) → mark(sel1(X1, X2))
sel1(X1, mark(X2)) → mark(sel1(X1, X2))
quote(mark(X)) → mark(quote(X))
proper(dbl(X)) → dbl(proper(X))
proper(0) → ok(0)
proper(s(X)) → s(proper(X))
proper(dbls(X)) → dbls(proper(X))
proper(nil) → ok(nil)
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(sel(X1, X2)) → sel(proper(X1), proper(X2))
proper(indx(X1, X2)) → indx(proper(X1), proper(X2))
proper(from(X)) → from(proper(X))
proper(dbl1(X)) → dbl1(proper(X))
proper(01) → ok(01)
proper(s1(X)) → s1(proper(X))
proper(sel1(X1, X2)) → sel1(proper(X1), proper(X2))
proper(quote(X)) → quote(proper(X))
dbl(ok(X)) → ok(dbl(X))
s(ok(X)) → ok(s(X))
dbls(ok(X)) → ok(dbls(X))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
sel(ok(X1), ok(X2)) → ok(sel(X1, X2))
indx(ok(X1), ok(X2)) → ok(indx(X1, X2))
from(ok(X)) → ok(from(X))
dbl1(ok(X)) → ok(dbl1(X))
s1(ok(X)) → ok(s1(X))
sel1(ok(X1), ok(X2)) → ok(sel1(X1, X2))
quote(ok(X)) → ok(quote(X))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].

The following pairs can be oriented strictly and are deleted.

INDX(mark(X1), X2) → INDX(X1, X2)

The remaining pairs can at least be oriented weakly.
none
Used ordering: Combined order from the following AFS and order.
INDX(x1, x2) = x1
mark(x1) = mark(x1)

Lexicographic Path Order [19].
Precedence:

trivial

The following usable rules [14] were oriented: none

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ EdgeDeletionProof

        ↳ QDP

          ↳ DependencyGraphProof

            ↳ AND

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

                ↳ QDPOrderProof

                  ↳ QDP

                    ↳ QDPOrderProof

                      ↳ QDP

                        ↳ PisEmptyProof

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

Q DP problem:
P is empty.
The TRS R consists of the following rules:

active(dbl(0)) → mark(0)
active(dbl(s(X))) → mark(s(s(dbl(X))))
active(dbls(nil)) → mark(nil)
active(dbls(cons(X, Y))) → mark(cons(dbl(X), dbls(Y)))
active(sel(0, cons(X, Y))) → mark(X)
active(sel(s(X), cons(Y, Z))) → mark(sel(X, Z))
active(indx(nil, X)) → mark(nil)
active(indx(cons(X, Y), Z)) → mark(cons(sel(X, Z), indx(Y, Z)))
active(from(X)) → mark(cons(X, from(s(X))))
active(dbl1(0)) → mark(01)
active(dbl1(s(X))) → mark(s1(s1(dbl1(X))))
active(sel1(0, cons(X, Y))) → mark(X)
active(sel1(s(X), cons(Y, Z))) → mark(sel1(X, Z))
active(quote(0)) → mark(01)
active(quote(s(X))) → mark(s1(quote(X)))
active(quote(dbl(X))) → mark(dbl1(X))
active(quote(sel(X, Y))) → mark(sel1(X, Y))
active(dbl(X)) → dbl(active(X))
active(dbls(X)) → dbls(active(X))
active(sel(X1, X2)) → sel(active(X1), X2)
active(sel(X1, X2)) → sel(X1, active(X2))
active(indx(X1, X2)) → indx(active(X1), X2)
active(dbl1(X)) → dbl1(active(X))
active(s1(X)) → s1(active(X))
active(sel1(X1, X2)) → sel1(active(X1), X2)
active(sel1(X1, X2)) → sel1(X1, active(X2))
active(quote(X)) → quote(active(X))
dbl(mark(X)) → mark(dbl(X))
dbls(mark(X)) → mark(dbls(X))
sel(mark(X1), X2) → mark(sel(X1, X2))
sel(X1, mark(X2)) → mark(sel(X1, X2))
indx(mark(X1), X2) → mark(indx(X1, X2))
dbl1(mark(X)) → mark(dbl1(X))
s1(mark(X)) → mark(s1(X))
sel1(mark(X1), X2) → mark(sel1(X1, X2))
sel1(X1, mark(X2)) → mark(sel1(X1, X2))
quote(mark(X)) → mark(quote(X))
proper(dbl(X)) → dbl(proper(X))
proper(0) → ok(0)
proper(s(X)) → s(proper(X))
proper(dbls(X)) → dbls(proper(X))
proper(nil) → ok(nil)
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(sel(X1, X2)) → sel(proper(X1), proper(X2))
proper(indx(X1, X2)) → indx(proper(X1), proper(X2))
proper(from(X)) → from(proper(X))
proper(dbl1(X)) → dbl1(proper(X))
proper(01) → ok(01)
proper(s1(X)) → s1(proper(X))
proper(sel1(X1, X2)) → sel1(proper(X1), proper(X2))
proper(quote(X)) → quote(proper(X))
dbl(ok(X)) → ok(dbl(X))
s(ok(X)) → ok(s(X))
dbls(ok(X)) → ok(dbls(X))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
sel(ok(X1), ok(X2)) → ok(sel(X1, X2))
indx(ok(X1), ok(X2)) → ok(indx(X1, X2))
from(ok(X)) → ok(from(X))
dbl1(ok(X)) → ok(dbl1(X))
s1(ok(X)) → ok(s1(X))
sel1(ok(X1), ok(X2)) → ok(sel1(X1, X2))
quote(ok(X)) → ok(quote(X))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The TRS P is empty. Hence, there is no (P,Q,R) chain.

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ EdgeDeletionProof

        ↳ QDP

          ↳ DependencyGraphProof

            ↳ AND

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

                ↳ QDPOrderProof

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

SEL(X1, mark(X2)) → SEL(X1, X2)
SEL(ok(X1), ok(X2)) → SEL(X1, X2)
SEL(mark(X1), X2) → SEL(X1, X2)

The TRS R consists of the following rules:

active(dbl(0)) → mark(0)
active(dbl(s(X))) → mark(s(s(dbl(X))))
active(dbls(nil)) → mark(nil)
active(dbls(cons(X, Y))) → mark(cons(dbl(X), dbls(Y)))
active(sel(0, cons(X, Y))) → mark(X)
active(sel(s(X), cons(Y, Z))) → mark(sel(X, Z))
active(indx(nil, X)) → mark(nil)
active(indx(cons(X, Y), Z)) → mark(cons(sel(X, Z), indx(Y, Z)))
active(from(X)) → mark(cons(X, from(s(X))))
active(dbl1(0)) → mark(01)
active(dbl1(s(X))) → mark(s1(s1(dbl1(X))))
active(sel1(0, cons(X, Y))) → mark(X)
active(sel1(s(X), cons(Y, Z))) → mark(sel1(X, Z))
active(quote(0)) → mark(01)
active(quote(s(X))) → mark(s1(quote(X)))
active(quote(dbl(X))) → mark(dbl1(X))
active(quote(sel(X, Y))) → mark(sel1(X, Y))
active(dbl(X)) → dbl(active(X))
active(dbls(X)) → dbls(active(X))
active(sel(X1, X2)) → sel(active(X1), X2)
active(sel(X1, X2)) → sel(X1, active(X2))
active(indx(X1, X2)) → indx(active(X1), X2)
active(dbl1(X)) → dbl1(active(X))
active(s1(X)) → s1(active(X))
active(sel1(X1, X2)) → sel1(active(X1), X2)
active(sel1(X1, X2)) → sel1(X1, active(X2))
active(quote(X)) → quote(active(X))
dbl(mark(X)) → mark(dbl(X))
dbls(mark(X)) → mark(dbls(X))
sel(mark(X1), X2) → mark(sel(X1, X2))
sel(X1, mark(X2)) → mark(sel(X1, X2))
indx(mark(X1), X2) → mark(indx(X1, X2))
dbl1(mark(X)) → mark(dbl1(X))
s1(mark(X)) → mark(s1(X))
sel1(mark(X1), X2) → mark(sel1(X1, X2))
sel1(X1, mark(X2)) → mark(sel1(X1, X2))
quote(mark(X)) → mark(quote(X))
proper(dbl(X)) → dbl(proper(X))
proper(0) → ok(0)
proper(s(X)) → s(proper(X))
proper(dbls(X)) → dbls(proper(X))
proper(nil) → ok(nil)
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(sel(X1, X2)) → sel(proper(X1), proper(X2))
proper(indx(X1, X2)) → indx(proper(X1), proper(X2))
proper(from(X)) → from(proper(X))
proper(dbl1(X)) → dbl1(proper(X))
proper(01) → ok(01)
proper(s1(X)) → s1(proper(X))
proper(sel1(X1, X2)) → sel1(proper(X1), proper(X2))
proper(quote(X)) → quote(proper(X))
dbl(ok(X)) → ok(dbl(X))
s(ok(X)) → ok(s(X))
dbls(ok(X)) → ok(dbls(X))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
sel(ok(X1), ok(X2)) → ok(sel(X1, X2))
indx(ok(X1), ok(X2)) → ok(indx(X1, X2))
from(ok(X)) → ok(from(X))
dbl1(ok(X)) → ok(dbl1(X))
s1(ok(X)) → ok(s1(X))
sel1(ok(X1), ok(X2)) → ok(sel1(X1, X2))
quote(ok(X)) → ok(quote(X))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].

The following pairs can be oriented strictly and are deleted.

SEL(ok(X1), ok(X2)) → SEL(X1, X2)

The remaining pairs can at least be oriented weakly.

SEL(X1, mark(X2)) → SEL(X1, X2)
SEL(mark(X1), X2) → SEL(X1, X2)

Used ordering: Combined order from the following AFS and order.
SEL(x1, x2) = x2
mark(x1) = x1
ok(x1) = ok(x1)

Lexicographic Path Order [19].
Precedence:

trivial

The following usable rules [14] were oriented: none

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ EdgeDeletionProof

        ↳ QDP

          ↳ DependencyGraphProof

            ↳ AND

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

                ↳ QDPOrderProof

                  ↳ QDP

                    ↳ QDPOrderProof

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

SEL(X1, mark(X2)) → SEL(X1, X2)
SEL(mark(X1), X2) → SEL(X1, X2)

The TRS R consists of the following rules:

active(dbl(0)) → mark(0)
active(dbl(s(X))) → mark(s(s(dbl(X))))
active(dbls(nil)) → mark(nil)
active(dbls(cons(X, Y))) → mark(cons(dbl(X), dbls(Y)))
active(sel(0, cons(X, Y))) → mark(X)
active(sel(s(X), cons(Y, Z))) → mark(sel(X, Z))
active(indx(nil, X)) → mark(nil)
active(indx(cons(X, Y), Z)) → mark(cons(sel(X, Z), indx(Y, Z)))
active(from(X)) → mark(cons(X, from(s(X))))
active(dbl1(0)) → mark(01)
active(dbl1(s(X))) → mark(s1(s1(dbl1(X))))
active(sel1(0, cons(X, Y))) → mark(X)
active(sel1(s(X), cons(Y, Z))) → mark(sel1(X, Z))
active(quote(0)) → mark(01)
active(quote(s(X))) → mark(s1(quote(X)))
active(quote(dbl(X))) → mark(dbl1(X))
active(quote(sel(X, Y))) → mark(sel1(X, Y))
active(dbl(X)) → dbl(active(X))
active(dbls(X)) → dbls(active(X))
active(sel(X1, X2)) → sel(active(X1), X2)
active(sel(X1, X2)) → sel(X1, active(X2))
active(indx(X1, X2)) → indx(active(X1), X2)
active(dbl1(X)) → dbl1(active(X))
active(s1(X)) → s1(active(X))
active(sel1(X1, X2)) → sel1(active(X1), X2)
active(sel1(X1, X2)) → sel1(X1, active(X2))
active(quote(X)) → quote(active(X))
dbl(mark(X)) → mark(dbl(X))
dbls(mark(X)) → mark(dbls(X))
sel(mark(X1), X2) → mark(sel(X1, X2))
sel(X1, mark(X2)) → mark(sel(X1, X2))
indx(mark(X1), X2) → mark(indx(X1, X2))
dbl1(mark(X)) → mark(dbl1(X))
s1(mark(X)) → mark(s1(X))
sel1(mark(X1), X2) → mark(sel1(X1, X2))
sel1(X1, mark(X2)) → mark(sel1(X1, X2))
quote(mark(X)) → mark(quote(X))
proper(dbl(X)) → dbl(proper(X))
proper(0) → ok(0)
proper(s(X)) → s(proper(X))
proper(dbls(X)) → dbls(proper(X))
proper(nil) → ok(nil)
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(sel(X1, X2)) → sel(proper(X1), proper(X2))
proper(indx(X1, X2)) → indx(proper(X1), proper(X2))
proper(from(X)) → from(proper(X))
proper(dbl1(X)) → dbl1(proper(X))
proper(01) → ok(01)
proper(s1(X)) → s1(proper(X))
proper(sel1(X1, X2)) → sel1(proper(X1), proper(X2))
proper(quote(X)) → quote(proper(X))
dbl(ok(X)) → ok(dbl(X))
s(ok(X)) → ok(s(X))
dbls(ok(X)) → ok(dbls(X))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
sel(ok(X1), ok(X2)) → ok(sel(X1, X2))
indx(ok(X1), ok(X2)) → ok(indx(X1, X2))
from(ok(X)) → ok(from(X))
dbl1(ok(X)) → ok(dbl1(X))
s1(ok(X)) → ok(s1(X))
sel1(ok(X1), ok(X2)) → ok(sel1(X1, X2))
quote(ok(X)) → ok(quote(X))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].

The following pairs can be oriented strictly and are deleted.

SEL(X1, mark(X2)) → SEL(X1, X2)

The remaining pairs can at least be oriented weakly.

SEL(mark(X1), X2) → SEL(X1, X2)

Used ordering: Combined order from the following AFS and order.
SEL(x1, x2) = x2
mark(x1) = mark(x1)

Lexicographic Path Order [19].
Precedence:

trivial

The following usable rules [14] were oriented: none

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ EdgeDeletionProof

        ↳ QDP

          ↳ DependencyGraphProof

            ↳ AND

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

                ↳ QDPOrderProof

                  ↳ QDP

                    ↳ QDPOrderProof

                      ↳ QDP

                        ↳ QDPOrderProof

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

SEL(mark(X1), X2) → SEL(X1, X2)

The TRS R consists of the following rules:

active(dbl(0)) → mark(0)
active(dbl(s(X))) → mark(s(s(dbl(X))))
active(dbls(nil)) → mark(nil)
active(dbls(cons(X, Y))) → mark(cons(dbl(X), dbls(Y)))
active(sel(0, cons(X, Y))) → mark(X)
active(sel(s(X), cons(Y, Z))) → mark(sel(X, Z))
active(indx(nil, X)) → mark(nil)
active(indx(cons(X, Y), Z)) → mark(cons(sel(X, Z), indx(Y, Z)))
active(from(X)) → mark(cons(X, from(s(X))))
active(dbl1(0)) → mark(01)
active(dbl1(s(X))) → mark(s1(s1(dbl1(X))))
active(sel1(0, cons(X, Y))) → mark(X)
active(sel1(s(X), cons(Y, Z))) → mark(sel1(X, Z))
active(quote(0)) → mark(01)
active(quote(s(X))) → mark(s1(quote(X)))
active(quote(dbl(X))) → mark(dbl1(X))
active(quote(sel(X, Y))) → mark(sel1(X, Y))
active(dbl(X)) → dbl(active(X))
active(dbls(X)) → dbls(active(X))
active(sel(X1, X2)) → sel(active(X1), X2)
active(sel(X1, X2)) → sel(X1, active(X2))
active(indx(X1, X2)) → indx(active(X1), X2)
active(dbl1(X)) → dbl1(active(X))
active(s1(X)) → s1(active(X))
active(sel1(X1, X2)) → sel1(active(X1), X2)
active(sel1(X1, X2)) → sel1(X1, active(X2))
active(quote(X)) → quote(active(X))
dbl(mark(X)) → mark(dbl(X))
dbls(mark(X)) → mark(dbls(X))
sel(mark(X1), X2) → mark(sel(X1, X2))
sel(X1, mark(X2)) → mark(sel(X1, X2))
indx(mark(X1), X2) → mark(indx(X1, X2))
dbl1(mark(X)) → mark(dbl1(X))
s1(mark(X)) → mark(s1(X))
sel1(mark(X1), X2) → mark(sel1(X1, X2))
sel1(X1, mark(X2)) → mark(sel1(X1, X2))
quote(mark(X)) → mark(quote(X))
proper(dbl(X)) → dbl(proper(X))
proper(0) → ok(0)
proper(s(X)) → s(proper(X))
proper(dbls(X)) → dbls(proper(X))
proper(nil) → ok(nil)
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(sel(X1, X2)) → sel(proper(X1), proper(X2))
proper(indx(X1, X2)) → indx(proper(X1), proper(X2))
proper(from(X)) → from(proper(X))
proper(dbl1(X)) → dbl1(proper(X))
proper(01) → ok(01)
proper(s1(X)) → s1(proper(X))
proper(sel1(X1, X2)) → sel1(proper(X1), proper(X2))
proper(quote(X)) → quote(proper(X))
dbl(ok(X)) → ok(dbl(X))
s(ok(X)) → ok(s(X))
dbls(ok(X)) → ok(dbls(X))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
sel(ok(X1), ok(X2)) → ok(sel(X1, X2))
indx(ok(X1), ok(X2)) → ok(indx(X1, X2))
from(ok(X)) → ok(from(X))
dbl1(ok(X)) → ok(dbl1(X))
s1(ok(X)) → ok(s1(X))
sel1(ok(X1), ok(X2)) → ok(sel1(X1, X2))
quote(ok(X)) → ok(quote(X))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].

The following pairs can be oriented strictly and are deleted.

SEL(mark(X1), X2) → SEL(X1, X2)

The remaining pairs can at least be oriented weakly.
none
Used ordering: Combined order from the following AFS and order.
SEL(x1, x2) = x1
mark(x1) = mark(x1)

Lexicographic Path Order [19].
Precedence:

trivial

The following usable rules [14] were oriented: none

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ EdgeDeletionProof

        ↳ QDP

          ↳ DependencyGraphProof

            ↳ AND

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

                ↳ QDPOrderProof

                  ↳ QDP

                    ↳ QDPOrderProof

                      ↳ QDP

                        ↳ QDPOrderProof

                          ↳ QDP

                            ↳ PisEmptyProof

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

Q DP problem:
P is empty.
The TRS R consists of the following rules:

active(dbl(0)) → mark(0)
active(dbl(s(X))) → mark(s(s(dbl(X))))
active(dbls(nil)) → mark(nil)
active(dbls(cons(X, Y))) → mark(cons(dbl(X), dbls(Y)))
active(sel(0, cons(X, Y))) → mark(X)
active(sel(s(X), cons(Y, Z))) → mark(sel(X, Z))
active(indx(nil, X)) → mark(nil)
active(indx(cons(X, Y), Z)) → mark(cons(sel(X, Z), indx(Y, Z)))
active(from(X)) → mark(cons(X, from(s(X))))
active(dbl1(0)) → mark(01)
active(dbl1(s(X))) → mark(s1(s1(dbl1(X))))
active(sel1(0, cons(X, Y))) → mark(X)
active(sel1(s(X), cons(Y, Z))) → mark(sel1(X, Z))
active(quote(0)) → mark(01)
active(quote(s(X))) → mark(s1(quote(X)))
active(quote(dbl(X))) → mark(dbl1(X))
active(quote(sel(X, Y))) → mark(sel1(X, Y))
active(dbl(X)) → dbl(active(X))
active(dbls(X)) → dbls(active(X))
active(sel(X1, X2)) → sel(active(X1), X2)
active(sel(X1, X2)) → sel(X1, active(X2))
active(indx(X1, X2)) → indx(active(X1), X2)
active(dbl1(X)) → dbl1(active(X))
active(s1(X)) → s1(active(X))
active(sel1(X1, X2)) → sel1(active(X1), X2)
active(sel1(X1, X2)) → sel1(X1, active(X2))
active(quote(X)) → quote(active(X))
dbl(mark(X)) → mark(dbl(X))
dbls(mark(X)) → mark(dbls(X))
sel(mark(X1), X2) → mark(sel(X1, X2))
sel(X1, mark(X2)) → mark(sel(X1, X2))
indx(mark(X1), X2) → mark(indx(X1, X2))
dbl1(mark(X)) → mark(dbl1(X))
s1(mark(X)) → mark(s1(X))
sel1(mark(X1), X2) → mark(sel1(X1, X2))
sel1(X1, mark(X2)) → mark(sel1(X1, X2))
quote(mark(X)) → mark(quote(X))
proper(dbl(X)) → dbl(proper(X))
proper(0) → ok(0)
proper(s(X)) → s(proper(X))
proper(dbls(X)) → dbls(proper(X))
proper(nil) → ok(nil)
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(sel(X1, X2)) → sel(proper(X1), proper(X2))
proper(indx(X1, X2)) → indx(proper(X1), proper(X2))
proper(from(X)) → from(proper(X))
proper(dbl1(X)) → dbl1(proper(X))
proper(01) → ok(01)
proper(s1(X)) → s1(proper(X))
proper(sel1(X1, X2)) → sel1(proper(X1), proper(X2))
proper(quote(X)) → quote(proper(X))
dbl(ok(X)) → ok(dbl(X))
s(ok(X)) → ok(s(X))
dbls(ok(X)) → ok(dbls(X))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
sel(ok(X1), ok(X2)) → ok(sel(X1, X2))
indx(ok(X1), ok(X2)) → ok(indx(X1, X2))
from(ok(X)) → ok(from(X))
dbl1(ok(X)) → ok(dbl1(X))
s1(ok(X)) → ok(s1(X))
sel1(ok(X1), ok(X2)) → ok(sel1(X1, X2))
quote(ok(X)) → ok(quote(X))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The TRS P is empty. Hence, there is no (P,Q,R) chain.

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ EdgeDeletionProof

        ↳ QDP

          ↳ DependencyGraphProof

            ↳ AND

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

                ↳ QDPOrderProof

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

DBLS(ok(X)) → DBLS(X)
DBLS(mark(X)) → DBLS(X)

The TRS R consists of the following rules:

active(dbl(0)) → mark(0)
active(dbl(s(X))) → mark(s(s(dbl(X))))
active(dbls(nil)) → mark(nil)
active(dbls(cons(X, Y))) → mark(cons(dbl(X), dbls(Y)))
active(sel(0, cons(X, Y))) → mark(X)
active(sel(s(X), cons(Y, Z))) → mark(sel(X, Z))
active(indx(nil, X)) → mark(nil)
active(indx(cons(X, Y), Z)) → mark(cons(sel(X, Z), indx(Y, Z)))
active(from(X)) → mark(cons(X, from(s(X))))
active(dbl1(0)) → mark(01)
active(dbl1(s(X))) → mark(s1(s1(dbl1(X))))
active(sel1(0, cons(X, Y))) → mark(X)
active(sel1(s(X), cons(Y, Z))) → mark(sel1(X, Z))
active(quote(0)) → mark(01)
active(quote(s(X))) → mark(s1(quote(X)))
active(quote(dbl(X))) → mark(dbl1(X))
active(quote(sel(X, Y))) → mark(sel1(X, Y))
active(dbl(X)) → dbl(active(X))
active(dbls(X)) → dbls(active(X))
active(sel(X1, X2)) → sel(active(X1), X2)
active(sel(X1, X2)) → sel(X1, active(X2))
active(indx(X1, X2)) → indx(active(X1), X2)
active(dbl1(X)) → dbl1(active(X))
active(s1(X)) → s1(active(X))
active(sel1(X1, X2)) → sel1(active(X1), X2)
active(sel1(X1, X2)) → sel1(X1, active(X2))
active(quote(X)) → quote(active(X))
dbl(mark(X)) → mark(dbl(X))
dbls(mark(X)) → mark(dbls(X))
sel(mark(X1), X2) → mark(sel(X1, X2))
sel(X1, mark(X2)) → mark(sel(X1, X2))
indx(mark(X1), X2) → mark(indx(X1, X2))
dbl1(mark(X)) → mark(dbl1(X))
s1(mark(X)) → mark(s1(X))
sel1(mark(X1), X2) → mark(sel1(X1, X2))
sel1(X1, mark(X2)) → mark(sel1(X1, X2))
quote(mark(X)) → mark(quote(X))
proper(dbl(X)) → dbl(proper(X))
proper(0) → ok(0)
proper(s(X)) → s(proper(X))
proper(dbls(X)) → dbls(proper(X))
proper(nil) → ok(nil)
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(sel(X1, X2)) → sel(proper(X1), proper(X2))
proper(indx(X1, X2)) → indx(proper(X1), proper(X2))
proper(from(X)) → from(proper(X))
proper(dbl1(X)) → dbl1(proper(X))
proper(01) → ok(01)
proper(s1(X)) → s1(proper(X))
proper(sel1(X1, X2)) → sel1(proper(X1), proper(X2))
proper(quote(X)) → quote(proper(X))
dbl(ok(X)) → ok(dbl(X))
s(ok(X)) → ok(s(X))
dbls(ok(X)) → ok(dbls(X))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
sel(ok(X1), ok(X2)) → ok(sel(X1, X2))
indx(ok(X1), ok(X2)) → ok(indx(X1, X2))
from(ok(X)) → ok(from(X))
dbl1(ok(X)) → ok(dbl1(X))
s1(ok(X)) → ok(s1(X))
sel1(ok(X1), ok(X2)) → ok(sel1(X1, X2))
quote(ok(X)) → ok(quote(X))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].

The following pairs can be oriented strictly and are deleted.

DBLS(mark(X)) → DBLS(X)

The remaining pairs can at least be oriented weakly.

DBLS(ok(X)) → DBLS(X)

Used ordering: Combined order from the following AFS and order.
DBLS(x1) = x1
ok(x1) = x1
mark(x1) = mark(x1)

Lexicographic Path Order [19].
Precedence:

trivial

The following usable rules [14] were oriented: none

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ EdgeDeletionProof

        ↳ QDP

          ↳ DependencyGraphProof

            ↳ AND

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

                ↳ QDPOrderProof

                  ↳ QDP

                    ↳ QDPOrderProof

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

DBLS(ok(X)) → DBLS(X)

The TRS R consists of the following rules:

active(dbl(0)) → mark(0)
active(dbl(s(X))) → mark(s(s(dbl(X))))
active(dbls(nil)) → mark(nil)
active(dbls(cons(X, Y))) → mark(cons(dbl(X), dbls(Y)))
active(sel(0, cons(X, Y))) → mark(X)
active(sel(s(X), cons(Y, Z))) → mark(sel(X, Z))
active(indx(nil, X)) → mark(nil)
active(indx(cons(X, Y), Z)) → mark(cons(sel(X, Z), indx(Y, Z)))
active(from(X)) → mark(cons(X, from(s(X))))
active(dbl1(0)) → mark(01)
active(dbl1(s(X))) → mark(s1(s1(dbl1(X))))
active(sel1(0, cons(X, Y))) → mark(X)
active(sel1(s(X), cons(Y, Z))) → mark(sel1(X, Z))
active(quote(0)) → mark(01)
active(quote(s(X))) → mark(s1(quote(X)))
active(quote(dbl(X))) → mark(dbl1(X))
active(quote(sel(X, Y))) → mark(sel1(X, Y))
active(dbl(X)) → dbl(active(X))
active(dbls(X)) → dbls(active(X))
active(sel(X1, X2)) → sel(active(X1), X2)
active(sel(X1, X2)) → sel(X1, active(X2))
active(indx(X1, X2)) → indx(active(X1), X2)
active(dbl1(X)) → dbl1(active(X))
active(s1(X)) → s1(active(X))
active(sel1(X1, X2)) → sel1(active(X1), X2)
active(sel1(X1, X2)) → sel1(X1, active(X2))
active(quote(X)) → quote(active(X))
dbl(mark(X)) → mark(dbl(X))
dbls(mark(X)) → mark(dbls(X))
sel(mark(X1), X2) → mark(sel(X1, X2))
sel(X1, mark(X2)) → mark(sel(X1, X2))
indx(mark(X1), X2) → mark(indx(X1, X2))
dbl1(mark(X)) → mark(dbl1(X))
s1(mark(X)) → mark(s1(X))
sel1(mark(X1), X2) → mark(sel1(X1, X2))
sel1(X1, mark(X2)) → mark(sel1(X1, X2))
quote(mark(X)) → mark(quote(X))
proper(dbl(X)) → dbl(proper(X))
proper(0) → ok(0)
proper(s(X)) → s(proper(X))
proper(dbls(X)) → dbls(proper(X))
proper(nil) → ok(nil)
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(sel(X1, X2)) → sel(proper(X1), proper(X2))
proper(indx(X1, X2)) → indx(proper(X1), proper(X2))
proper(from(X)) → from(proper(X))
proper(dbl1(X)) → dbl1(proper(X))
proper(01) → ok(01)
proper(s1(X)) → s1(proper(X))
proper(sel1(X1, X2)) → sel1(proper(X1), proper(X2))
proper(quote(X)) → quote(proper(X))
dbl(ok(X)) → ok(dbl(X))
s(ok(X)) → ok(s(X))
dbls(ok(X)) → ok(dbls(X))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
sel(ok(X1), ok(X2)) → ok(sel(X1, X2))
indx(ok(X1), ok(X2)) → ok(indx(X1, X2))
from(ok(X)) → ok(from(X))
dbl1(ok(X)) → ok(dbl1(X))
s1(ok(X)) → ok(s1(X))
sel1(ok(X1), ok(X2)) → ok(sel1(X1, X2))
quote(ok(X)) → ok(quote(X))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].

The following pairs can be oriented strictly and are deleted.

DBLS(ok(X)) → DBLS(X)

The remaining pairs can at least be oriented weakly.
none
Used ordering: Combined order from the following AFS and order.
DBLS(x1) = x1
ok(x1) = ok(x1)

Lexicographic Path Order [19].
Precedence:

trivial

The following usable rules [14] were oriented: none

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ EdgeDeletionProof

        ↳ QDP

          ↳ DependencyGraphProof

            ↳ AND

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

                ↳ QDPOrderProof

                  ↳ QDP

                    ↳ QDPOrderProof

                      ↳ QDP

                        ↳ PisEmptyProof

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

Q DP problem:
P is empty.
The TRS R consists of the following rules:

active(dbl(0)) → mark(0)
active(dbl(s(X))) → mark(s(s(dbl(X))))
active(dbls(nil)) → mark(nil)
active(dbls(cons(X, Y))) → mark(cons(dbl(X), dbls(Y)))
active(sel(0, cons(X, Y))) → mark(X)
active(sel(s(X), cons(Y, Z))) → mark(sel(X, Z))
active(indx(nil, X)) → mark(nil)
active(indx(cons(X, Y), Z)) → mark(cons(sel(X, Z), indx(Y, Z)))
active(from(X)) → mark(cons(X, from(s(X))))
active(dbl1(0)) → mark(01)
active(dbl1(s(X))) → mark(s1(s1(dbl1(X))))
active(sel1(0, cons(X, Y))) → mark(X)
active(sel1(s(X), cons(Y, Z))) → mark(sel1(X, Z))
active(quote(0)) → mark(01)
active(quote(s(X))) → mark(s1(quote(X)))
active(quote(dbl(X))) → mark(dbl1(X))
active(quote(sel(X, Y))) → mark(sel1(X, Y))
active(dbl(X)) → dbl(active(X))
active(dbls(X)) → dbls(active(X))
active(sel(X1, X2)) → sel(active(X1), X2)
active(sel(X1, X2)) → sel(X1, active(X2))
active(indx(X1, X2)) → indx(active(X1), X2)
active(dbl1(X)) → dbl1(active(X))
active(s1(X)) → s1(active(X))
active(sel1(X1, X2)) → sel1(active(X1), X2)
active(sel1(X1, X2)) → sel1(X1, active(X2))
active(quote(X)) → quote(active(X))
dbl(mark(X)) → mark(dbl(X))
dbls(mark(X)) → mark(dbls(X))
sel(mark(X1), X2) → mark(sel(X1, X2))
sel(X1, mark(X2)) → mark(sel(X1, X2))
indx(mark(X1), X2) → mark(indx(X1, X2))
dbl1(mark(X)) → mark(dbl1(X))
s1(mark(X)) → mark(s1(X))
sel1(mark(X1), X2) → mark(sel1(X1, X2))
sel1(X1, mark(X2)) → mark(sel1(X1, X2))
quote(mark(X)) → mark(quote(X))
proper(dbl(X)) → dbl(proper(X))
proper(0) → ok(0)
proper(s(X)) → s(proper(X))
proper(dbls(X)) → dbls(proper(X))
proper(nil) → ok(nil)
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(sel(X1, X2)) → sel(proper(X1), proper(X2))
proper(indx(X1, X2)) → indx(proper(X1), proper(X2))
proper(from(X)) → from(proper(X))
proper(dbl1(X)) → dbl1(proper(X))
proper(01) → ok(01)
proper(s1(X)) → s1(proper(X))
proper(sel1(X1, X2)) → sel1(proper(X1), proper(X2))
proper(quote(X)) → quote(proper(X))
dbl(ok(X)) → ok(dbl(X))
s(ok(X)) → ok(s(X))
dbls(ok(X)) → ok(dbls(X))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
sel(ok(X1), ok(X2)) → ok(sel(X1, X2))
indx(ok(X1), ok(X2)) → ok(indx(X1, X2))
from(ok(X)) → ok(from(X))
dbl1(ok(X)) → ok(dbl1(X))
s1(ok(X)) → ok(s1(X))
sel1(ok(X1), ok(X2)) → ok(sel1(X1, X2))
quote(ok(X)) → ok(quote(X))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The TRS P is empty. Hence, there is no (P,Q,R) chain.

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ EdgeDeletionProof

        ↳ QDP

          ↳ DependencyGraphProof

            ↳ AND

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

                ↳ QDPOrderProof

              ↳ QDP

              ↳ QDP

              ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

DBL(mark(X)) → DBL(X)
DBL(ok(X)) → DBL(X)

The TRS R consists of the following rules:

active(dbl(0)) → mark(0)
active(dbl(s(X))) → mark(s(s(dbl(X))))
active(dbls(nil)) → mark(nil)
active(dbls(cons(X, Y))) → mark(cons(dbl(X), dbls(Y)))
active(sel(0, cons(X, Y))) → mark(X)
active(sel(s(X), cons(Y, Z))) → mark(sel(X, Z))
active(indx(nil, X)) → mark(nil)
active(indx(cons(X, Y), Z)) → mark(cons(sel(X, Z), indx(Y, Z)))
active(from(X)) → mark(cons(X, from(s(X))))
active(dbl1(0)) → mark(01)
active(dbl1(s(X))) → mark(s1(s1(dbl1(X))))
active(sel1(0, cons(X, Y))) → mark(X)
active(sel1(s(X), cons(Y, Z))) → mark(sel1(X, Z))
active(quote(0)) → mark(01)
active(quote(s(X))) → mark(s1(quote(X)))
active(quote(dbl(X))) → mark(dbl1(X))
active(quote(sel(X, Y))) → mark(sel1(X, Y))
active(dbl(X)) → dbl(active(X))
active(dbls(X)) → dbls(active(X))
active(sel(X1, X2)) → sel(active(X1), X2)
active(sel(X1, X2)) → sel(X1, active(X2))
active(indx(X1, X2)) → indx(active(X1), X2)
active(dbl1(X)) → dbl1(active(X))
active(s1(X)) → s1(active(X))
active(sel1(X1, X2)) → sel1(active(X1), X2)
active(sel1(X1, X2)) → sel1(X1, active(X2))
active(quote(X)) → quote(active(X))
dbl(mark(X)) → mark(dbl(X))
dbls(mark(X)) → mark(dbls(X))
sel(mark(X1), X2) → mark(sel(X1, X2))
sel(X1, mark(X2)) → mark(sel(X1, X2))
indx(mark(X1), X2) → mark(indx(X1, X2))
dbl1(mark(X)) → mark(dbl1(X))
s1(mark(X)) → mark(s1(X))
sel1(mark(X1), X2) → mark(sel1(X1, X2))
sel1(X1, mark(X2)) → mark(sel1(X1, X2))
quote(mark(X)) → mark(quote(X))
proper(dbl(X)) → dbl(proper(X))
proper(0) → ok(0)
proper(s(X)) → s(proper(X))
proper(dbls(X)) → dbls(proper(X))
proper(nil) → ok(nil)
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(sel(X1, X2)) → sel(proper(X1), proper(X2))
proper(indx(X1, X2)) → indx(proper(X1), proper(X2))
proper(from(X)) → from(proper(X))
proper(dbl1(X)) → dbl1(proper(X))
proper(01) → ok(01)
proper(s1(X)) → s1(proper(X))
proper(sel1(X1, X2)) → sel1(proper(X1), proper(X2))
proper(quote(X)) → quote(proper(X))
dbl(ok(X)) → ok(dbl(X))
s(ok(X)) → ok(s(X))
dbls(ok(X)) → ok(dbls(X))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
sel(ok(X1), ok(X2)) → ok(sel(X1, X2))
indx(ok(X1), ok(X2)) → ok(indx(X1, X2))
from(ok(X)) → ok(from(X))
dbl1(ok(X)) → ok(dbl1(X))
s1(ok(X)) → ok(s1(X))
sel1(ok(X1), ok(X2)) → ok(sel1(X1, X2))
quote(ok(X)) → ok(quote(X))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].

The following pairs can be oriented strictly and are deleted.

DBL(ok(X)) → DBL(X)

The remaining pairs can at least be oriented weakly.

DBL(mark(X)) → DBL(X)

Used ordering: Combined order from the following AFS and order.
DBL(x1) = x1
mark(x1) = x1
ok(x1) = ok(x1)

Lexicographic Path Order [19].
Precedence:

trivial

The following usable rules [14] were oriented: none

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ EdgeDeletionProof

        ↳ QDP

          ↳ DependencyGraphProof

            ↳ AND

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

                ↳ QDPOrderProof

                  ↳ QDP

                    ↳ QDPOrderProof

              ↳ QDP

              ↳ QDP

              ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

DBL(mark(X)) → DBL(X)

The TRS R consists of the following rules:

active(dbl(0)) → mark(0)
active(dbl(s(X))) → mark(s(s(dbl(X))))
active(dbls(nil)) → mark(nil)
active(dbls(cons(X, Y))) → mark(cons(dbl(X), dbls(Y)))
active(sel(0, cons(X, Y))) → mark(X)
active(sel(s(X), cons(Y, Z))) → mark(sel(X, Z))
active(indx(nil, X)) → mark(nil)
active(indx(cons(X, Y), Z)) → mark(cons(sel(X, Z), indx(Y, Z)))
active(from(X)) → mark(cons(X, from(s(X))))
active(dbl1(0)) → mark(01)
active(dbl1(s(X))) → mark(s1(s1(dbl1(X))))
active(sel1(0, cons(X, Y))) → mark(X)
active(sel1(s(X), cons(Y, Z))) → mark(sel1(X, Z))
active(quote(0)) → mark(01)
active(quote(s(X))) → mark(s1(quote(X)))
active(quote(dbl(X))) → mark(dbl1(X))
active(quote(sel(X, Y))) → mark(sel1(X, Y))
active(dbl(X)) → dbl(active(X))
active(dbls(X)) → dbls(active(X))
active(sel(X1, X2)) → sel(active(X1), X2)
active(sel(X1, X2)) → sel(X1, active(X2))
active(indx(X1, X2)) → indx(active(X1), X2)
active(dbl1(X)) → dbl1(active(X))
active(s1(X)) → s1(active(X))
active(sel1(X1, X2)) → sel1(active(X1), X2)
active(sel1(X1, X2)) → sel1(X1, active(X2))
active(quote(X)) → quote(active(X))
dbl(mark(X)) → mark(dbl(X))
dbls(mark(X)) → mark(dbls(X))
sel(mark(X1), X2) → mark(sel(X1, X2))
sel(X1, mark(X2)) → mark(sel(X1, X2))
indx(mark(X1), X2) → mark(indx(X1, X2))
dbl1(mark(X)) → mark(dbl1(X))
s1(mark(X)) → mark(s1(X))
sel1(mark(X1), X2) → mark(sel1(X1, X2))
sel1(X1, mark(X2)) → mark(sel1(X1, X2))
quote(mark(X)) → mark(quote(X))
proper(dbl(X)) → dbl(proper(X))
proper(0) → ok(0)
proper(s(X)) → s(proper(X))
proper(dbls(X)) → dbls(proper(X))
proper(nil) → ok(nil)
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(sel(X1, X2)) → sel(proper(X1), proper(X2))
proper(indx(X1, X2)) → indx(proper(X1), proper(X2))
proper(from(X)) → from(proper(X))
proper(dbl1(X)) → dbl1(proper(X))
proper(01) → ok(01)
proper(s1(X)) → s1(proper(X))
proper(sel1(X1, X2)) → sel1(proper(X1), proper(X2))
proper(quote(X)) → quote(proper(X))
dbl(ok(X)) → ok(dbl(X))
s(ok(X)) → ok(s(X))
dbls(ok(X)) → ok(dbls(X))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
sel(ok(X1), ok(X2)) → ok(sel(X1, X2))
indx(ok(X1), ok(X2)) → ok(indx(X1, X2))
from(ok(X)) → ok(from(X))
dbl1(ok(X)) → ok(dbl1(X))
s1(ok(X)) → ok(s1(X))
sel1(ok(X1), ok(X2)) → ok(sel1(X1, X2))
quote(ok(X)) → ok(quote(X))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].

The following pairs can be oriented strictly and are deleted.

DBL(mark(X)) → DBL(X)

The remaining pairs can at least be oriented weakly.
none
Used ordering: Combined order from the following AFS and order.
DBL(x1) = x1
mark(x1) = mark(x1)

Lexicographic Path Order [19].
Precedence:

trivial

The following usable rules [14] were oriented: none

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ EdgeDeletionProof

        ↳ QDP

          ↳ DependencyGraphProof

            ↳ AND

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

                ↳ QDPOrderProof

                  ↳ QDP

                    ↳ QDPOrderProof

                      ↳ QDP

                        ↳ PisEmptyProof

              ↳ QDP

              ↳ QDP

              ↳ QDP

Q DP problem:
P is empty.
The TRS R consists of the following rules:

active(dbl(0)) → mark(0)
active(dbl(s(X))) → mark(s(s(dbl(X))))
active(dbls(nil)) → mark(nil)
active(dbls(cons(X, Y))) → mark(cons(dbl(X), dbls(Y)))
active(sel(0, cons(X, Y))) → mark(X)
active(sel(s(X), cons(Y, Z))) → mark(sel(X, Z))
active(indx(nil, X)) → mark(nil)
active(indx(cons(X, Y), Z)) → mark(cons(sel(X, Z), indx(Y, Z)))
active(from(X)) → mark(cons(X, from(s(X))))
active(dbl1(0)) → mark(01)
active(dbl1(s(X))) → mark(s1(s1(dbl1(X))))
active(sel1(0, cons(X, Y))) → mark(X)
active(sel1(s(X), cons(Y, Z))) → mark(sel1(X, Z))
active(quote(0)) → mark(01)
active(quote(s(X))) → mark(s1(quote(X)))
active(quote(dbl(X))) → mark(dbl1(X))
active(quote(sel(X, Y))) → mark(sel1(X, Y))
active(dbl(X)) → dbl(active(X))
active(dbls(X)) → dbls(active(X))
active(sel(X1, X2)) → sel(active(X1), X2)
active(sel(X1, X2)) → sel(X1, active(X2))
active(indx(X1, X2)) → indx(active(X1), X2)
active(dbl1(X)) → dbl1(active(X))
active(s1(X)) → s1(active(X))
active(sel1(X1, X2)) → sel1(active(X1), X2)
active(sel1(X1, X2)) → sel1(X1, active(X2))
active(quote(X)) → quote(active(X))
dbl(mark(X)) → mark(dbl(X))
dbls(mark(X)) → mark(dbls(X))
sel(mark(X1), X2) → mark(sel(X1, X2))
sel(X1, mark(X2)) → mark(sel(X1, X2))
indx(mark(X1), X2) → mark(indx(X1, X2))
dbl1(mark(X)) → mark(dbl1(X))
s1(mark(X)) → mark(s1(X))
sel1(mark(X1), X2) → mark(sel1(X1, X2))
sel1(X1, mark(X2)) → mark(sel1(X1, X2))
quote(mark(X)) → mark(quote(X))
proper(dbl(X)) → dbl(proper(X))
proper(0) → ok(0)
proper(s(X)) → s(proper(X))
proper(dbls(X)) → dbls(proper(X))
proper(nil) → ok(nil)
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(sel(X1, X2)) → sel(proper(X1), proper(X2))
proper(indx(X1, X2)) → indx(proper(X1), proper(X2))
proper(from(X)) → from(proper(X))
proper(dbl1(X)) → dbl1(proper(X))
proper(01) → ok(01)
proper(s1(X)) → s1(proper(X))
proper(sel1(X1, X2)) → sel1(proper(X1), proper(X2))
proper(quote(X)) → quote(proper(X))
dbl(ok(X)) → ok(dbl(X))
s(ok(X)) → ok(s(X))
dbls(ok(X)) → ok(dbls(X))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
sel(ok(X1), ok(X2)) → ok(sel(X1, X2))
indx(ok(X1), ok(X2)) → ok(indx(X1, X2))
from(ok(X)) → ok(from(X))
dbl1(ok(X)) → ok(dbl1(X))
s1(ok(X)) → ok(s1(X))
sel1(ok(X1), ok(X2)) → ok(sel1(X1, X2))
quote(ok(X)) → ok(quote(X))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The TRS P is empty. Hence, there is no (P,Q,R) chain.

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ EdgeDeletionProof

        ↳ QDP

          ↳ DependencyGraphProof

            ↳ AND

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

                ↳ QDPOrderProof

              ↳ QDP

              ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

PROPER(quote(X)) → PROPER(X)
PROPER(cons(X1, X2)) → PROPER(X1)
PROPER(sel(X1, X2)) → PROPER(X1)
PROPER(s1(X)) → PROPER(X)
PROPER(indx(X1, X2)) → PROPER(X2)
PROPER(sel1(X1, X2)) → PROPER(X2)
PROPER(sel(X1, X2)) → PROPER(X2)
PROPER(s(X)) → PROPER(X)
PROPER(from(X)) → PROPER(X)
PROPER(cons(X1, X2)) → PROPER(X2)
PROPER(sel1(X1, X2)) → PROPER(X1)
PROPER(dbls(X)) → PROPER(X)
PROPER(indx(X1, X2)) → PROPER(X1)
PROPER(dbl1(X)) → PROPER(X)
PROPER(dbl(X)) → PROPER(X)

The TRS R consists of the following rules:

active(dbl(0)) → mark(0)
active(dbl(s(X))) → mark(s(s(dbl(X))))
active(dbls(nil)) → mark(nil)
active(dbls(cons(X, Y))) → mark(cons(dbl(X), dbls(Y)))
active(sel(0, cons(X, Y))) → mark(X)
active(sel(s(X), cons(Y, Z))) → mark(sel(X, Z))
active(indx(nil, X)) → mark(nil)
active(indx(cons(X, Y), Z)) → mark(cons(sel(X, Z), indx(Y, Z)))
active(from(X)) → mark(cons(X, from(s(X))))
active(dbl1(0)) → mark(01)
active(dbl1(s(X))) → mark(s1(s1(dbl1(X))))
active(sel1(0, cons(X, Y))) → mark(X)
active(sel1(s(X), cons(Y, Z))) → mark(sel1(X, Z))
active(quote(0)) → mark(01)
active(quote(s(X))) → mark(s1(quote(X)))
active(quote(dbl(X))) → mark(dbl1(X))
active(quote(sel(X, Y))) → mark(sel1(X, Y))
active(dbl(X)) → dbl(active(X))
active(dbls(X)) → dbls(active(X))
active(sel(X1, X2)) → sel(active(X1), X2)
active(sel(X1, X2)) → sel(X1, active(X2))
active(indx(X1, X2)) → indx(active(X1), X2)
active(dbl1(X)) → dbl1(active(X))
active(s1(X)) → s1(active(X))
active(sel1(X1, X2)) → sel1(active(X1), X2)
active(sel1(X1, X2)) → sel1(X1, active(X2))
active(quote(X)) → quote(active(X))
dbl(mark(X)) → mark(dbl(X))
dbls(mark(X)) → mark(dbls(X))
sel(mark(X1), X2) → mark(sel(X1, X2))
sel(X1, mark(X2)) → mark(sel(X1, X2))
indx(mark(X1), X2) → mark(indx(X1, X2))
dbl1(mark(X)) → mark(dbl1(X))
s1(mark(X)) → mark(s1(X))
sel1(mark(X1), X2) → mark(sel1(X1, X2))
sel1(X1, mark(X2)) → mark(sel1(X1, X2))
quote(mark(X)) → mark(quote(X))
proper(dbl(X)) → dbl(proper(X))
proper(0) → ok(0)
proper(s(X)) → s(proper(X))
proper(dbls(X)) → dbls(proper(X))
proper(nil) → ok(nil)
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(sel(X1, X2)) → sel(proper(X1), proper(X2))
proper(indx(X1, X2)) → indx(proper(X1), proper(X2))
proper(from(X)) → from(proper(X))
proper(dbl1(X)) → dbl1(proper(X))
proper(01) → ok(01)
proper(s1(X)) → s1(proper(X))
proper(sel1(X1, X2)) → sel1(proper(X1), proper(X2))
proper(quote(X)) → quote(proper(X))
dbl(ok(X)) → ok(dbl(X))
s(ok(X)) → ok(s(X))
dbls(ok(X)) → ok(dbls(X))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
sel(ok(X1), ok(X2)) → ok(sel(X1, X2))
indx(ok(X1), ok(X2)) → ok(indx(X1, X2))
from(ok(X)) → ok(from(X))
dbl1(ok(X)) → ok(dbl1(X))
s1(ok(X)) → ok(s1(X))
sel1(ok(X1), ok(X2)) → ok(sel1(X1, X2))
quote(ok(X)) → ok(quote(X))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].

The following pairs can be oriented strictly and are deleted.

PROPER(cons(X1, X2)) → PROPER(X1)
PROPER(sel(X1, X2)) → PROPER(X1)
PROPER(indx(X1, X2)) → PROPER(X2)
PROPER(sel1(X1, X2)) → PROPER(X2)
PROPER(sel(X1, X2)) → PROPER(X2)
PROPER(cons(X1, X2)) → PROPER(X2)
PROPER(sel1(X1, X2)) → PROPER(X1)
PROPER(indx(X1, X2)) → PROPER(X1)

The remaining pairs can at least be oriented weakly.

PROPER(quote(X)) → PROPER(X)
PROPER(s1(X)) → PROPER(X)
PROPER(s(X)) → PROPER(X)
PROPER(from(X)) → PROPER(X)
PROPER(dbls(X)) → PROPER(X)
PROPER(dbl1(X)) → PROPER(X)
PROPER(dbl(X)) → PROPER(X)

Used ordering: Combined order from the following AFS and order.
PROPER(x1) = x1
quote(x1) = x1
cons(x1, x2) = cons(x1, x2)
sel(x1, x2) = sel(x1, x2)
s1(x1) = x1
indx(x1, x2) = indx(x1, x2)
sel1(x1, x2) = sel1(x1, x2)
s(x1) = x1
from(x1) = x1
dbls(x1) = x1
dbl1(x1) = x1
dbl(x1) = x1

Lexicographic Path Order [19].
Precedence:

trivial

The following usable rules [14] were oriented: none

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ EdgeDeletionProof

        ↳ QDP

          ↳ DependencyGraphProof

            ↳ AND

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

                ↳ QDPOrderProof

                  ↳ QDP

                    ↳ QDPOrderProof

              ↳ QDP

              ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

PROPER(quote(X)) → PROPER(X)
PROPER(s(X)) → PROPER(X)
PROPER(from(X)) → PROPER(X)
PROPER(s1(X)) → PROPER(X)
PROPER(dbls(X)) → PROPER(X)
PROPER(dbl1(X)) → PROPER(X)
PROPER(dbl(X)) → PROPER(X)

The TRS R consists of the following rules:

active(dbl(0)) → mark(0)
active(dbl(s(X))) → mark(s(s(dbl(X))))
active(dbls(nil)) → mark(nil)
active(dbls(cons(X, Y))) → mark(cons(dbl(X), dbls(Y)))
active(sel(0, cons(X, Y))) → mark(X)
active(sel(s(X), cons(Y, Z))) → mark(sel(X, Z))
active(indx(nil, X)) → mark(nil)
active(indx(cons(X, Y), Z)) → mark(cons(sel(X, Z), indx(Y, Z)))
active(from(X)) → mark(cons(X, from(s(X))))
active(dbl1(0)) → mark(01)
active(dbl1(s(X))) → mark(s1(s1(dbl1(X))))
active(sel1(0, cons(X, Y))) → mark(X)
active(sel1(s(X), cons(Y, Z))) → mark(sel1(X, Z))
active(quote(0)) → mark(01)
active(quote(s(X))) → mark(s1(quote(X)))
active(quote(dbl(X))) → mark(dbl1(X))
active(quote(sel(X, Y))) → mark(sel1(X, Y))
active(dbl(X)) → dbl(active(X))
active(dbls(X)) → dbls(active(X))
active(sel(X1, X2)) → sel(active(X1), X2)
active(sel(X1, X2)) → sel(X1, active(X2))
active(indx(X1, X2)) → indx(active(X1), X2)
active(dbl1(X)) → dbl1(active(X))
active(s1(X)) → s1(active(X))
active(sel1(X1, X2)) → sel1(active(X1), X2)
active(sel1(X1, X2)) → sel1(X1, active(X2))
active(quote(X)) → quote(active(X))
dbl(mark(X)) → mark(dbl(X))
dbls(mark(X)) → mark(dbls(X))
sel(mark(X1), X2) → mark(sel(X1, X2))
sel(X1, mark(X2)) → mark(sel(X1, X2))
indx(mark(X1), X2) → mark(indx(X1, X2))
dbl1(mark(X)) → mark(dbl1(X))
s1(mark(X)) → mark(s1(X))
sel1(mark(X1), X2) → mark(sel1(X1, X2))
sel1(X1, mark(X2)) → mark(sel1(X1, X2))
quote(mark(X)) → mark(quote(X))
proper(dbl(X)) → dbl(proper(X))
proper(0) → ok(0)
proper(s(X)) → s(proper(X))
proper(dbls(X)) → dbls(proper(X))
proper(nil) → ok(nil)
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(sel(X1, X2)) → sel(proper(X1), proper(X2))
proper(indx(X1, X2)) → indx(proper(X1), proper(X2))
proper(from(X)) → from(proper(X))
proper(dbl1(X)) → dbl1(proper(X))
proper(01) → ok(01)
proper(s1(X)) → s1(proper(X))
proper(sel1(X1, X2)) → sel1(proper(X1), proper(X2))
proper(quote(X)) → quote(proper(X))
dbl(ok(X)) → ok(dbl(X))
s(ok(X)) → ok(s(X))
dbls(ok(X)) → ok(dbls(X))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
sel(ok(X1), ok(X2)) → ok(sel(X1, X2))
indx(ok(X1), ok(X2)) → ok(indx(X1, X2))
from(ok(X)) → ok(from(X))
dbl1(ok(X)) → ok(dbl1(X))
s1(ok(X)) → ok(s1(X))
sel1(ok(X1), ok(X2)) → ok(sel1(X1, X2))
quote(ok(X)) → ok(quote(X))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].

The following pairs can be oriented strictly and are deleted.

PROPER(dbl(X)) → PROPER(X)

The remaining pairs can at least be oriented weakly.

PROPER(quote(X)) → PROPER(X)
PROPER(s(X)) → PROPER(X)
PROPER(from(X)) → PROPER(X)
PROPER(s1(X)) → PROPER(X)
PROPER(dbls(X)) → PROPER(X)
PROPER(dbl1(X)) → PROPER(X)

Used ordering: Combined order from the following AFS and order.
PROPER(x1) = x1
quote(x1) = x1
s(x1) = x1
from(x1) = x1
s1(x1) = x1
dbls(x1) = x1
dbl1(x1) = x1
dbl(x1) = dbl(x1)

Lexicographic Path Order [19].
Precedence:

trivial

The following usable rules [14] were oriented: none

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ EdgeDeletionProof

        ↳ QDP

          ↳ DependencyGraphProof

            ↳ AND

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

                ↳ QDPOrderProof

                  ↳ QDP

                    ↳ QDPOrderProof

                      ↳ QDP

                        ↳ QDPOrderProof

              ↳ QDP

              ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

PROPER(quote(X)) → PROPER(X)
PROPER(s(X)) → PROPER(X)
PROPER(from(X)) → PROPER(X)
PROPER(s1(X)) → PROPER(X)
PROPER(dbls(X)) → PROPER(X)
PROPER(dbl1(X)) → PROPER(X)

The TRS R consists of the following rules:

active(dbl(0)) → mark(0)
active(dbl(s(X))) → mark(s(s(dbl(X))))
active(dbls(nil)) → mark(nil)
active(dbls(cons(X, Y))) → mark(cons(dbl(X), dbls(Y)))
active(sel(0, cons(X, Y))) → mark(X)
active(sel(s(X), cons(Y, Z))) → mark(sel(X, Z))
active(indx(nil, X)) → mark(nil)
active(indx(cons(X, Y), Z)) → mark(cons(sel(X, Z), indx(Y, Z)))
active(from(X)) → mark(cons(X, from(s(X))))
active(dbl1(0)) → mark(01)
active(dbl1(s(X))) → mark(s1(s1(dbl1(X))))
active(sel1(0, cons(X, Y))) → mark(X)
active(sel1(s(X), cons(Y, Z))) → mark(sel1(X, Z))
active(quote(0)) → mark(01)
active(quote(s(X))) → mark(s1(quote(X)))
active(quote(dbl(X))) → mark(dbl1(X))
active(quote(sel(X, Y))) → mark(sel1(X, Y))
active(dbl(X)) → dbl(active(X))
active(dbls(X)) → dbls(active(X))
active(sel(X1, X2)) → sel(active(X1), X2)
active(sel(X1, X2)) → sel(X1, active(X2))
active(indx(X1, X2)) → indx(active(X1), X2)
active(dbl1(X)) → dbl1(active(X))
active(s1(X)) → s1(active(X))
active(sel1(X1, X2)) → sel1(active(X1), X2)
active(sel1(X1, X2)) → sel1(X1, active(X2))
active(quote(X)) → quote(active(X))
dbl(mark(X)) → mark(dbl(X))
dbls(mark(X)) → mark(dbls(X))
sel(mark(X1), X2) → mark(sel(X1, X2))
sel(X1, mark(X2)) → mark(sel(X1, X2))
indx(mark(X1), X2) → mark(indx(X1, X2))
dbl1(mark(X)) → mark(dbl1(X))
s1(mark(X)) → mark(s1(X))
sel1(mark(X1), X2) → mark(sel1(X1, X2))
sel1(X1, mark(X2)) → mark(sel1(X1, X2))
quote(mark(X)) → mark(quote(X))
proper(dbl(X)) → dbl(proper(X))
proper(0) → ok(0)
proper(s(X)) → s(proper(X))
proper(dbls(X)) → dbls(proper(X))
proper(nil) → ok(nil)
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(sel(X1, X2)) → sel(proper(X1), proper(X2))
proper(indx(X1, X2)) → indx(proper(X1), proper(X2))
proper(from(X)) → from(proper(X))
proper(dbl1(X)) → dbl1(proper(X))
proper(01) → ok(01)
proper(s1(X)) → s1(proper(X))
proper(sel1(X1, X2)) → sel1(proper(X1), proper(X2))
proper(quote(X)) → quote(proper(X))
dbl(ok(X)) → ok(dbl(X))
s(ok(X)) → ok(s(X))
dbls(ok(X)) → ok(dbls(X))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
sel(ok(X1), ok(X2)) → ok(sel(X1, X2))
indx(ok(X1), ok(X2)) → ok(indx(X1, X2))
from(ok(X)) → ok(from(X))
dbl1(ok(X)) → ok(dbl1(X))
s1(ok(X)) → ok(s1(X))
sel1(ok(X1), ok(X2)) → ok(sel1(X1, X2))
quote(ok(X)) → ok(quote(X))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].

The following pairs can be oriented strictly and are deleted.

PROPER(dbl1(X)) → PROPER(X)

The remaining pairs can at least be oriented weakly.

PROPER(quote(X)) → PROPER(X)
PROPER(s(X)) → PROPER(X)
PROPER(from(X)) → PROPER(X)
PROPER(s1(X)) → PROPER(X)
PROPER(dbls(X)) → PROPER(X)

Used ordering: Combined order from the following AFS and order.
PROPER(x1) = x1
quote(x1) = x1
s(x1) = x1
from(x1) = x1
s1(x1) = x1
dbls(x1) = x1
dbl1(x1) = dbl1(x1)

Lexicographic Path Order [19].
Precedence:

trivial

The following usable rules [14] were oriented: none

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ EdgeDeletionProof

        ↳ QDP

          ↳ DependencyGraphProof

            ↳ AND

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

                ↳ QDPOrderProof

                  ↳ QDP

                    ↳ QDPOrderProof

                      ↳ QDP

                        ↳ QDPOrderProof

                          ↳ QDP

                            ↳ QDPOrderProof

              ↳ QDP

              ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

PROPER(quote(X)) → PROPER(X)
PROPER(s(X)) → PROPER(X)
PROPER(from(X)) → PROPER(X)
PROPER(s1(X)) → PROPER(X)
PROPER(dbls(X)) → PROPER(X)

The TRS R consists of the following rules:

active(dbl(0)) → mark(0)
active(dbl(s(X))) → mark(s(s(dbl(X))))
active(dbls(nil)) → mark(nil)
active(dbls(cons(X, Y))) → mark(cons(dbl(X), dbls(Y)))
active(sel(0, cons(X, Y))) → mark(X)
active(sel(s(X), cons(Y, Z))) → mark(sel(X, Z))
active(indx(nil, X)) → mark(nil)
active(indx(cons(X, Y), Z)) → mark(cons(sel(X, Z), indx(Y, Z)))
active(from(X)) → mark(cons(X, from(s(X))))
active(dbl1(0)) → mark(01)
active(dbl1(s(X))) → mark(s1(s1(dbl1(X))))
active(sel1(0, cons(X, Y))) → mark(X)
active(sel1(s(X), cons(Y, Z))) → mark(sel1(X, Z))
active(quote(0)) → mark(01)
active(quote(s(X))) → mark(s1(quote(X)))
active(quote(dbl(X))) → mark(dbl1(X))
active(quote(sel(X, Y))) → mark(sel1(X, Y))
active(dbl(X)) → dbl(active(X))
active(dbls(X)) → dbls(active(X))
active(sel(X1, X2)) → sel(active(X1), X2)
active(sel(X1, X2)) → sel(X1, active(X2))
active(indx(X1, X2)) → indx(active(X1), X2)
active(dbl1(X)) → dbl1(active(X))
active(s1(X)) → s1(active(X))
active(sel1(X1, X2)) → sel1(active(X1), X2)
active(sel1(X1, X2)) → sel1(X1, active(X2))
active(quote(X)) → quote(active(X))
dbl(mark(X)) → mark(dbl(X))
dbls(mark(X)) → mark(dbls(X))
sel(mark(X1), X2) → mark(sel(X1, X2))
sel(X1, mark(X2)) → mark(sel(X1, X2))
indx(mark(X1), X2) → mark(indx(X1, X2))
dbl1(mark(X)) → mark(dbl1(X))
s1(mark(X)) → mark(s1(X))
sel1(mark(X1), X2) → mark(sel1(X1, X2))
sel1(X1, mark(X2)) → mark(sel1(X1, X2))
quote(mark(X)) → mark(quote(X))
proper(dbl(X)) → dbl(proper(X))
proper(0) → ok(0)
proper(s(X)) → s(proper(X))
proper(dbls(X)) → dbls(proper(X))
proper(nil) → ok(nil)
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(sel(X1, X2)) → sel(proper(X1), proper(X2))
proper(indx(X1, X2)) → indx(proper(X1), proper(X2))
proper(from(X)) → from(proper(X))
proper(dbl1(X)) → dbl1(proper(X))
proper(01) → ok(01)
proper(s1(X)) → s1(proper(X))
proper(sel1(X1, X2)) → sel1(proper(X1), proper(X2))
proper(quote(X)) → quote(proper(X))
dbl(ok(X)) → ok(dbl(X))
s(ok(X)) → ok(s(X))
dbls(ok(X)) → ok(dbls(X))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
sel(ok(X1), ok(X2)) → ok(sel(X1, X2))
indx(ok(X1), ok(X2)) → ok(indx(X1, X2))
from(ok(X)) → ok(from(X))
dbl1(ok(X)) → ok(dbl1(X))
s1(ok(X)) → ok(s1(X))
sel1(ok(X1), ok(X2)) → ok(sel1(X1, X2))
quote(ok(X)) → ok(quote(X))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].

The following pairs can be oriented strictly and are deleted.

PROPER(dbls(X)) → PROPER(X)

The remaining pairs can at least be oriented weakly.

PROPER(quote(X)) → PROPER(X)
PROPER(s(X)) → PROPER(X)
PROPER(from(X)) → PROPER(X)
PROPER(s1(X)) → PROPER(X)

Used ordering: Combined order from the following AFS and order.
PROPER(x1) = x1
quote(x1) = x1
s(x1) = x1
from(x1) = x1
s1(x1) = x1
dbls(x1) = dbls(x1)

Lexicographic Path Order [19].
Precedence:

trivial

The following usable rules [14] were oriented: none

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ EdgeDeletionProof

        ↳ QDP

          ↳ DependencyGraphProof

            ↳ AND

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

                ↳ QDPOrderProof

                  ↳ QDP

                    ↳ QDPOrderProof

                      ↳ QDP

                        ↳ QDPOrderProof

                          ↳ QDP

                            ↳ QDPOrderProof

                              ↳ QDP

                                ↳ QDPOrderProof

              ↳ QDP

              ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

PROPER(quote(X)) → PROPER(X)
PROPER(s(X)) → PROPER(X)
PROPER(from(X)) → PROPER(X)
PROPER(s1(X)) → PROPER(X)

The TRS R consists of the following rules:

active(dbl(0)) → mark(0)
active(dbl(s(X))) → mark(s(s(dbl(X))))
active(dbls(nil)) → mark(nil)
active(dbls(cons(X, Y))) → mark(cons(dbl(X), dbls(Y)))
active(sel(0, cons(X, Y))) → mark(X)
active(sel(s(X), cons(Y, Z))) → mark(sel(X, Z))
active(indx(nil, X)) → mark(nil)
active(indx(cons(X, Y), Z)) → mark(cons(sel(X, Z), indx(Y, Z)))
active(from(X)) → mark(cons(X, from(s(X))))
active(dbl1(0)) → mark(01)
active(dbl1(s(X))) → mark(s1(s1(dbl1(X))))
active(sel1(0, cons(X, Y))) → mark(X)
active(sel1(s(X), cons(Y, Z))) → mark(sel1(X, Z))
active(quote(0)) → mark(01)
active(quote(s(X))) → mark(s1(quote(X)))
active(quote(dbl(X))) → mark(dbl1(X))
active(quote(sel(X, Y))) → mark(sel1(X, Y))
active(dbl(X)) → dbl(active(X))
active(dbls(X)) → dbls(active(X))
active(sel(X1, X2)) → sel(active(X1), X2)
active(sel(X1, X2)) → sel(X1, active(X2))
active(indx(X1, X2)) → indx(active(X1), X2)
active(dbl1(X)) → dbl1(active(X))
active(s1(X)) → s1(active(X))
active(sel1(X1, X2)) → sel1(active(X1), X2)
active(sel1(X1, X2)) → sel1(X1, active(X2))
active(quote(X)) → quote(active(X))
dbl(mark(X)) → mark(dbl(X))
dbls(mark(X)) → mark(dbls(X))
sel(mark(X1), X2) → mark(sel(X1, X2))
sel(X1, mark(X2)) → mark(sel(X1, X2))
indx(mark(X1), X2) → mark(indx(X1, X2))
dbl1(mark(X)) → mark(dbl1(X))
s1(mark(X)) → mark(s1(X))
sel1(mark(X1), X2) → mark(sel1(X1, X2))
sel1(X1, mark(X2)) → mark(sel1(X1, X2))
quote(mark(X)) → mark(quote(X))
proper(dbl(X)) → dbl(proper(X))
proper(0) → ok(0)
proper(s(X)) → s(proper(X))
proper(dbls(X)) → dbls(proper(X))
proper(nil) → ok(nil)
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(sel(X1, X2)) → sel(proper(X1), proper(X2))
proper(indx(X1, X2)) → indx(proper(X1), proper(X2))
proper(from(X)) → from(proper(X))
proper(dbl1(X)) → dbl1(proper(X))
proper(01) → ok(01)
proper(s1(X)) → s1(proper(X))
proper(sel1(X1, X2)) → sel1(proper(X1), proper(X2))
proper(quote(X)) → quote(proper(X))
dbl(ok(X)) → ok(dbl(X))
s(ok(X)) → ok(s(X))
dbls(ok(X)) → ok(dbls(X))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
sel(ok(X1), ok(X2)) → ok(sel(X1, X2))
indx(ok(X1), ok(X2)) → ok(indx(X1, X2))
from(ok(X)) → ok(from(X))
dbl1(ok(X)) → ok(dbl1(X))
s1(ok(X)) → ok(s1(X))
sel1(ok(X1), ok(X2)) → ok(sel1(X1, X2))
quote(ok(X)) → ok(quote(X))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].

The following pairs can be oriented strictly and are deleted.

PROPER(s1(X)) → PROPER(X)

The remaining pairs can at least be oriented weakly.

PROPER(quote(X)) → PROPER(X)
PROPER(s(X)) → PROPER(X)
PROPER(from(X)) → PROPER(X)

Used ordering: Combined order from the following AFS and order.
PROPER(x1) = x1
quote(x1) = x1
s(x1) = x1
from(x1) = x1
s1(x1) = s1(x1)

Lexicographic Path Order [19].
Precedence:

trivial

The following usable rules [14] were oriented: none

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ EdgeDeletionProof

        ↳ QDP

          ↳ DependencyGraphProof

            ↳ AND

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

                ↳ QDPOrderProof

                  ↳ QDP

                    ↳ QDPOrderProof

                      ↳ QDP

                        ↳ QDPOrderProof

                          ↳ QDP

                            ↳ QDPOrderProof

                              ↳ QDP

                                ↳ QDPOrderProof

                                  ↳ QDP

                                    ↳ QDPOrderProof

              ↳ QDP

              ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

PROPER(quote(X)) → PROPER(X)
PROPER(s(X)) → PROPER(X)
PROPER(from(X)) → PROPER(X)

The TRS R consists of the following rules:

active(dbl(0)) → mark(0)
active(dbl(s(X))) → mark(s(s(dbl(X))))
active(dbls(nil)) → mark(nil)
active(dbls(cons(X, Y))) → mark(cons(dbl(X), dbls(Y)))
active(sel(0, cons(X, Y))) → mark(X)
active(sel(s(X), cons(Y, Z))) → mark(sel(X, Z))
active(indx(nil, X)) → mark(nil)
active(indx(cons(X, Y), Z)) → mark(cons(sel(X, Z), indx(Y, Z)))
active(from(X)) → mark(cons(X, from(s(X))))
active(dbl1(0)) → mark(01)
active(dbl1(s(X))) → mark(s1(s1(dbl1(X))))
active(sel1(0, cons(X, Y))) → mark(X)
active(sel1(s(X), cons(Y, Z))) → mark(sel1(X, Z))
active(quote(0)) → mark(01)
active(quote(s(X))) → mark(s1(quote(X)))
active(quote(dbl(X))) → mark(dbl1(X))
active(quote(sel(X, Y))) → mark(sel1(X, Y))
active(dbl(X)) → dbl(active(X))
active(dbls(X)) → dbls(active(X))
active(sel(X1, X2)) → sel(active(X1), X2)
active(sel(X1, X2)) → sel(X1, active(X2))
active(indx(X1, X2)) → indx(active(X1), X2)
active(dbl1(X)) → dbl1(active(X))
active(s1(X)) → s1(active(X))
active(sel1(X1, X2)) → sel1(active(X1), X2)
active(sel1(X1, X2)) → sel1(X1, active(X2))
active(quote(X)) → quote(active(X))
dbl(mark(X)) → mark(dbl(X))
dbls(mark(X)) → mark(dbls(X))
sel(mark(X1), X2) → mark(sel(X1, X2))
sel(X1, mark(X2)) → mark(sel(X1, X2))
indx(mark(X1), X2) → mark(indx(X1, X2))
dbl1(mark(X)) → mark(dbl1(X))
s1(mark(X)) → mark(s1(X))
sel1(mark(X1), X2) → mark(sel1(X1, X2))
sel1(X1, mark(X2)) → mark(sel1(X1, X2))
quote(mark(X)) → mark(quote(X))
proper(dbl(X)) → dbl(proper(X))
proper(0) → ok(0)
proper(s(X)) → s(proper(X))
proper(dbls(X)) → dbls(proper(X))
proper(nil) → ok(nil)
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(sel(X1, X2)) → sel(proper(X1), proper(X2))
proper(indx(X1, X2)) → indx(proper(X1), proper(X2))
proper(from(X)) → from(proper(X))
proper(dbl1(X)) → dbl1(proper(X))
proper(01) → ok(01)
proper(s1(X)) → s1(proper(X))
proper(sel1(X1, X2)) → sel1(proper(X1), proper(X2))
proper(quote(X)) → quote(proper(X))
dbl(ok(X)) → ok(dbl(X))
s(ok(X)) → ok(s(X))
dbls(ok(X)) → ok(dbls(X))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
sel(ok(X1), ok(X2)) → ok(sel(X1, X2))
indx(ok(X1), ok(X2)) → ok(indx(X1, X2))
from(ok(X)) → ok(from(X))
dbl1(ok(X)) → ok(dbl1(X))
s1(ok(X)) → ok(s1(X))
sel1(ok(X1), ok(X2)) → ok(sel1(X1, X2))
quote(ok(X)) → ok(quote(X))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].

The following pairs can be oriented strictly and are deleted.

PROPER(from(X)) → PROPER(X)

The remaining pairs can at least be oriented weakly.

PROPER(quote(X)) → PROPER(X)
PROPER(s(X)) → PROPER(X)

Used ordering: Combined order from the following AFS and order.
PROPER(x1) = x1
quote(x1) = x1
s(x1) = x1
from(x1) = from(x1)

Lexicographic Path Order [19].
Precedence:

trivial

The following usable rules [14] were oriented: none

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ EdgeDeletionProof

        ↳ QDP

          ↳ DependencyGraphProof

            ↳ AND

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

                ↳ QDPOrderProof

                  ↳ QDP

                    ↳ QDPOrderProof

                      ↳ QDP

                        ↳ QDPOrderProof

                          ↳ QDP

                            ↳ QDPOrderProof

                              ↳ QDP

                                ↳ QDPOrderProof

                                  ↳ QDP

                                    ↳ QDPOrderProof

                                      ↳ QDP

                                        ↳ QDPOrderProof

              ↳ QDP

              ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

PROPER(quote(X)) → PROPER(X)
PROPER(s(X)) → PROPER(X)

The TRS R consists of the following rules:

active(dbl(0)) → mark(0)
active(dbl(s(X))) → mark(s(s(dbl(X))))
active(dbls(nil)) → mark(nil)
active(dbls(cons(X, Y))) → mark(cons(dbl(X), dbls(Y)))
active(sel(0, cons(X, Y))) → mark(X)
active(sel(s(X), cons(Y, Z))) → mark(sel(X, Z))
active(indx(nil, X)) → mark(nil)
active(indx(cons(X, Y), Z)) → mark(cons(sel(X, Z), indx(Y, Z)))
active(from(X)) → mark(cons(X, from(s(X))))
active(dbl1(0)) → mark(01)
active(dbl1(s(X))) → mark(s1(s1(dbl1(X))))
active(sel1(0, cons(X, Y))) → mark(X)
active(sel1(s(X), cons(Y, Z))) → mark(sel1(X, Z))
active(quote(0)) → mark(01)
active(quote(s(X))) → mark(s1(quote(X)))
active(quote(dbl(X))) → mark(dbl1(X))
active(quote(sel(X, Y))) → mark(sel1(X, Y))
active(dbl(X)) → dbl(active(X))
active(dbls(X)) → dbls(active(X))
active(sel(X1, X2)) → sel(active(X1), X2)
active(sel(X1, X2)) → sel(X1, active(X2))
active(indx(X1, X2)) → indx(active(X1), X2)
active(dbl1(X)) → dbl1(active(X))
active(s1(X)) → s1(active(X))
active(sel1(X1, X2)) → sel1(active(X1), X2)
active(sel1(X1, X2)) → sel1(X1, active(X2))
active(quote(X)) → quote(active(X))
dbl(mark(X)) → mark(dbl(X))
dbls(mark(X)) → mark(dbls(X))
sel(mark(X1), X2) → mark(sel(X1, X2))
sel(X1, mark(X2)) → mark(sel(X1, X2))
indx(mark(X1), X2) → mark(indx(X1, X2))
dbl1(mark(X)) → mark(dbl1(X))
s1(mark(X)) → mark(s1(X))
sel1(mark(X1), X2) → mark(sel1(X1, X2))
sel1(X1, mark(X2)) → mark(sel1(X1, X2))
quote(mark(X)) → mark(quote(X))
proper(dbl(X)) → dbl(proper(X))
proper(0) → ok(0)
proper(s(X)) → s(proper(X))
proper(dbls(X)) → dbls(proper(X))
proper(nil) → ok(nil)
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(sel(X1, X2)) → sel(proper(X1), proper(X2))
proper(indx(X1, X2)) → indx(proper(X1), proper(X2))
proper(from(X)) → from(proper(X))
proper(dbl1(X)) → dbl1(proper(X))
proper(01) → ok(01)
proper(s1(X)) → s1(proper(X))
proper(sel1(X1, X2)) → sel1(proper(X1), proper(X2))
proper(quote(X)) → quote(proper(X))
dbl(ok(X)) → ok(dbl(X))
s(ok(X)) → ok(s(X))
dbls(ok(X)) → ok(dbls(X))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
sel(ok(X1), ok(X2)) → ok(sel(X1, X2))
indx(ok(X1), ok(X2)) → ok(indx(X1, X2))
from(ok(X)) → ok(from(X))
dbl1(ok(X)) → ok(dbl1(X))
s1(ok(X)) → ok(s1(X))
sel1(ok(X1), ok(X2)) → ok(sel1(X1, X2))
quote(ok(X)) → ok(quote(X))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].

The following pairs can be oriented strictly and are deleted.

PROPER(s(X)) → PROPER(X)

The remaining pairs can at least be oriented weakly.

PROPER(quote(X)) → PROPER(X)

Used ordering: Combined order from the following AFS and order.
PROPER(x1) = x1
quote(x1) = x1
s(x1) = s(x1)

Lexicographic Path Order [19].
Precedence:

trivial

The following usable rules [14] were oriented: none

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ EdgeDeletionProof

        ↳ QDP

          ↳ DependencyGraphProof

            ↳ AND

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

                ↳ QDPOrderProof

                  ↳ QDP

                    ↳ QDPOrderProof

                      ↳ QDP

                        ↳ QDPOrderProof

                          ↳ QDP

                            ↳ QDPOrderProof

                              ↳ QDP

                                ↳ QDPOrderProof

                                  ↳ QDP

                                    ↳ QDPOrderProof

                                      ↳ QDP

                                        ↳ QDPOrderProof

                                          ↳ QDP

                                            ↳ QDPOrderProof

              ↳ QDP

              ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

PROPER(quote(X)) → PROPER(X)

The TRS R consists of the following rules:

active(dbl(0)) → mark(0)
active(dbl(s(X))) → mark(s(s(dbl(X))))
active(dbls(nil)) → mark(nil)
active(dbls(cons(X, Y))) → mark(cons(dbl(X), dbls(Y)))
active(sel(0, cons(X, Y))) → mark(X)
active(sel(s(X), cons(Y, Z))) → mark(sel(X, Z))
active(indx(nil, X)) → mark(nil)
active(indx(cons(X, Y), Z)) → mark(cons(sel(X, Z), indx(Y, Z)))
active(from(X)) → mark(cons(X, from(s(X))))
active(dbl1(0)) → mark(01)
active(dbl1(s(X))) → mark(s1(s1(dbl1(X))))
active(sel1(0, cons(X, Y))) → mark(X)
active(sel1(s(X), cons(Y, Z))) → mark(sel1(X, Z))
active(quote(0)) → mark(01)
active(quote(s(X))) → mark(s1(quote(X)))
active(quote(dbl(X))) → mark(dbl1(X))
active(quote(sel(X, Y))) → mark(sel1(X, Y))
active(dbl(X)) → dbl(active(X))
active(dbls(X)) → dbls(active(X))
active(sel(X1, X2)) → sel(active(X1), X2)
active(sel(X1, X2)) → sel(X1, active(X2))
active(indx(X1, X2)) → indx(active(X1), X2)
active(dbl1(X)) → dbl1(active(X))
active(s1(X)) → s1(active(X))
active(sel1(X1, X2)) → sel1(active(X1), X2)
active(sel1(X1, X2)) → sel1(X1, active(X2))
active(quote(X)) → quote(active(X))
dbl(mark(X)) → mark(dbl(X))
dbls(mark(X)) → mark(dbls(X))
sel(mark(X1), X2) → mark(sel(X1, X2))
sel(X1, mark(X2)) → mark(sel(X1, X2))
indx(mark(X1), X2) → mark(indx(X1, X2))
dbl1(mark(X)) → mark(dbl1(X))
s1(mark(X)) → mark(s1(X))
sel1(mark(X1), X2) → mark(sel1(X1, X2))
sel1(X1, mark(X2)) → mark(sel1(X1, X2))
quote(mark(X)) → mark(quote(X))
proper(dbl(X)) → dbl(proper(X))
proper(0) → ok(0)
proper(s(X)) → s(proper(X))
proper(dbls(X)) → dbls(proper(X))
proper(nil) → ok(nil)
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(sel(X1, X2)) → sel(proper(X1), proper(X2))
proper(indx(X1, X2)) → indx(proper(X1), proper(X2))
proper(from(X)) → from(proper(X))
proper(dbl1(X)) → dbl1(proper(X))
proper(01) → ok(01)
proper(s1(X)) → s1(proper(X))
proper(sel1(X1, X2)) → sel1(proper(X1), proper(X2))
proper(quote(X)) → quote(proper(X))
dbl(ok(X)) → ok(dbl(X))
s(ok(X)) → ok(s(X))
dbls(ok(X)) → ok(dbls(X))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
sel(ok(X1), ok(X2)) → ok(sel(X1, X2))
indx(ok(X1), ok(X2)) → ok(indx(X1, X2))
from(ok(X)) → ok(from(X))
dbl1(ok(X)) → ok(dbl1(X))
s1(ok(X)) → ok(s1(X))
sel1(ok(X1), ok(X2)) → ok(sel1(X1, X2))
quote(ok(X)) → ok(quote(X))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].

The following pairs can be oriented strictly and are deleted.

PROPER(quote(X)) → PROPER(X)

The remaining pairs can at least be oriented weakly.
none
Used ordering: Combined order from the following AFS and order.
PROPER(x1) = x1
quote(x1) = quote(x1)

Lexicographic Path Order [19].
Precedence:

trivial

The following usable rules [14] were oriented: none

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ EdgeDeletionProof

        ↳ QDP

          ↳ DependencyGraphProof

            ↳ AND

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

                ↳ QDPOrderProof

                  ↳ QDP

                    ↳ QDPOrderProof

                      ↳ QDP

                        ↳ QDPOrderProof

                          ↳ QDP

                            ↳ QDPOrderProof

                              ↳ QDP

                                ↳ QDPOrderProof

                                  ↳ QDP

                                    ↳ QDPOrderProof

                                      ↳ QDP

                                        ↳ QDPOrderProof

                                          ↳ QDP

                                            ↳ QDPOrderProof

                                              ↳ QDP

                                                ↳ PisEmptyProof

              ↳ QDP

              ↳ QDP

Q DP problem:
P is empty.
The TRS R consists of the following rules:

active(dbl(0)) → mark(0)
active(dbl(s(X))) → mark(s(s(dbl(X))))
active(dbls(nil)) → mark(nil)
active(dbls(cons(X, Y))) → mark(cons(dbl(X), dbls(Y)))
active(sel(0, cons(X, Y))) → mark(X)
active(sel(s(X), cons(Y, Z))) → mark(sel(X, Z))
active(indx(nil, X)) → mark(nil)
active(indx(cons(X, Y), Z)) → mark(cons(sel(X, Z), indx(Y, Z)))
active(from(X)) → mark(cons(X, from(s(X))))
active(dbl1(0)) → mark(01)
active(dbl1(s(X))) → mark(s1(s1(dbl1(X))))
active(sel1(0, cons(X, Y))) → mark(X)
active(sel1(s(X), cons(Y, Z))) → mark(sel1(X, Z))
active(quote(0)) → mark(01)
active(quote(s(X))) → mark(s1(quote(X)))
active(quote(dbl(X))) → mark(dbl1(X))
active(quote(sel(X, Y))) → mark(sel1(X, Y))
active(dbl(X)) → dbl(active(X))
active(dbls(X)) → dbls(active(X))
active(sel(X1, X2)) → sel(active(X1), X2)
active(sel(X1, X2)) → sel(X1, active(X2))
active(indx(X1, X2)) → indx(active(X1), X2)
active(dbl1(X)) → dbl1(active(X))
active(s1(X)) → s1(active(X))
active(sel1(X1, X2)) → sel1(active(X1), X2)
active(sel1(X1, X2)) → sel1(X1, active(X2))
active(quote(X)) → quote(active(X))
dbl(mark(X)) → mark(dbl(X))
dbls(mark(X)) → mark(dbls(X))
sel(mark(X1), X2) → mark(sel(X1, X2))
sel(X1, mark(X2)) → mark(sel(X1, X2))
indx(mark(X1), X2) → mark(indx(X1, X2))
dbl1(mark(X)) → mark(dbl1(X))
s1(mark(X)) → mark(s1(X))
sel1(mark(X1), X2) → mark(sel1(X1, X2))
sel1(X1, mark(X2)) → mark(sel1(X1, X2))
quote(mark(X)) → mark(quote(X))
proper(dbl(X)) → dbl(proper(X))
proper(0) → ok(0)
proper(s(X)) → s(proper(X))
proper(dbls(X)) → dbls(proper(X))
proper(nil) → ok(nil)
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(sel(X1, X2)) → sel(proper(X1), proper(X2))
proper(indx(X1, X2)) → indx(proper(X1), proper(X2))
proper(from(X)) → from(proper(X))
proper(dbl1(X)) → dbl1(proper(X))
proper(01) → ok(01)
proper(s1(X)) → s1(proper(X))
proper(sel1(X1, X2)) → sel1(proper(X1), proper(X2))
proper(quote(X)) → quote(proper(X))
dbl(ok(X)) → ok(dbl(X))
s(ok(X)) → ok(s(X))
dbls(ok(X)) → ok(dbls(X))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
sel(ok(X1), ok(X2)) → ok(sel(X1, X2))
indx(ok(X1), ok(X2)) → ok(indx(X1, X2))
from(ok(X)) → ok(from(X))
dbl1(ok(X)) → ok(dbl1(X))
s1(ok(X)) → ok(s1(X))
sel1(ok(X1), ok(X2)) → ok(sel1(X1, X2))
quote(ok(X)) → ok(quote(X))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The TRS P is empty. Hence, there is no (P,Q,R) chain.

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ EdgeDeletionProof

        ↳ QDP

          ↳ DependencyGraphProof

            ↳ AND

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

                ↳ QDPOrderProof

              ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

ACTIVE(sel1(X1, X2)) → ACTIVE(X1)
ACTIVE(dbl1(X)) → ACTIVE(X)
ACTIVE(sel(X1, X2)) → ACTIVE(X2)
ACTIVE(quote(X)) → ACTIVE(X)
ACTIVE(indx(X1, X2)) → ACTIVE(X1)
ACTIVE(dbl(X)) → ACTIVE(X)
ACTIVE(sel1(X1, X2)) → ACTIVE(X2)
ACTIVE(sel(X1, X2)) → ACTIVE(X1)
ACTIVE(dbls(X)) → ACTIVE(X)
ACTIVE(s1(X)) → ACTIVE(X)

The TRS R consists of the following rules:

active(dbl(0)) → mark(0)
active(dbl(s(X))) → mark(s(s(dbl(X))))
active(dbls(nil)) → mark(nil)
active(dbls(cons(X, Y))) → mark(cons(dbl(X), dbls(Y)))
active(sel(0, cons(X, Y))) → mark(X)
active(sel(s(X), cons(Y, Z))) → mark(sel(X, Z))
active(indx(nil, X)) → mark(nil)
active(indx(cons(X, Y), Z)) → mark(cons(sel(X, Z), indx(Y, Z)))
active(from(X)) → mark(cons(X, from(s(X))))
active(dbl1(0)) → mark(01)
active(dbl1(s(X))) → mark(s1(s1(dbl1(X))))
active(sel1(0, cons(X, Y))) → mark(X)
active(sel1(s(X), cons(Y, Z))) → mark(sel1(X, Z))
active(quote(0)) → mark(01)
active(quote(s(X))) → mark(s1(quote(X)))
active(quote(dbl(X))) → mark(dbl1(X))
active(quote(sel(X, Y))) → mark(sel1(X, Y))
active(dbl(X)) → dbl(active(X))
active(dbls(X)) → dbls(active(X))
active(sel(X1, X2)) → sel(active(X1), X2)
active(sel(X1, X2)) → sel(X1, active(X2))
active(indx(X1, X2)) → indx(active(X1), X2)
active(dbl1(X)) → dbl1(active(X))
active(s1(X)) → s1(active(X))
active(sel1(X1, X2)) → sel1(active(X1), X2)
active(sel1(X1, X2)) → sel1(X1, active(X2))
active(quote(X)) → quote(active(X))
dbl(mark(X)) → mark(dbl(X))
dbls(mark(X)) → mark(dbls(X))
sel(mark(X1), X2) → mark(sel(X1, X2))
sel(X1, mark(X2)) → mark(sel(X1, X2))
indx(mark(X1), X2) → mark(indx(X1, X2))
dbl1(mark(X)) → mark(dbl1(X))
s1(mark(X)) → mark(s1(X))
sel1(mark(X1), X2) → mark(sel1(X1, X2))
sel1(X1, mark(X2)) → mark(sel1(X1, X2))
quote(mark(X)) → mark(quote(X))
proper(dbl(X)) → dbl(proper(X))
proper(0) → ok(0)
proper(s(X)) → s(proper(X))
proper(dbls(X)) → dbls(proper(X))
proper(nil) → ok(nil)
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(sel(X1, X2)) → sel(proper(X1), proper(X2))
proper(indx(X1, X2)) → indx(proper(X1), proper(X2))
proper(from(X)) → from(proper(X))
proper(dbl1(X)) → dbl1(proper(X))
proper(01) → ok(01)
proper(s1(X)) → s1(proper(X))
proper(sel1(X1, X2)) → sel1(proper(X1), proper(X2))
proper(quote(X)) → quote(proper(X))
dbl(ok(X)) → ok(dbl(X))
s(ok(X)) → ok(s(X))
dbls(ok(X)) → ok(dbls(X))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
sel(ok(X1), ok(X2)) → ok(sel(X1, X2))
indx(ok(X1), ok(X2)) → ok(indx(X1, X2))
from(ok(X)) → ok(from(X))
dbl1(ok(X)) → ok(dbl1(X))
s1(ok(X)) → ok(s1(X))
sel1(ok(X1), ok(X2)) → ok(sel1(X1, X2))
quote(ok(X)) → ok(quote(X))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].

The following pairs can be oriented strictly and are deleted.

ACTIVE(sel1(X1, X2)) → ACTIVE(X1)
ACTIVE(sel(X1, X2)) → ACTIVE(X2)
ACTIVE(sel1(X1, X2)) → ACTIVE(X2)
ACTIVE(sel(X1, X2)) → ACTIVE(X1)

The remaining pairs can at least be oriented weakly.

ACTIVE(dbl1(X)) → ACTIVE(X)
ACTIVE(quote(X)) → ACTIVE(X)
ACTIVE(indx(X1, X2)) → ACTIVE(X1)
ACTIVE(dbl(X)) → ACTIVE(X)
ACTIVE(dbls(X)) → ACTIVE(X)
ACTIVE(s1(X)) → ACTIVE(X)

Used ordering: Combined order from the following AFS and order.
ACTIVE(x1) = x1
sel1(x1, x2) = sel1(x1, x2)
dbl1(x1) = x1
sel(x1, x2) = sel(x1, x2)
quote(x1) = x1
indx(x1, x2) = x1
dbl(x1) = x1
dbls(x1) = x1
s1(x1) = x1

Lexicographic Path Order [19].
Precedence:

trivial

The following usable rules [14] were oriented: none

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ EdgeDeletionProof

        ↳ QDP

          ↳ DependencyGraphProof

            ↳ AND

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

                ↳ QDPOrderProof

                  ↳ QDP

                    ↳ QDPOrderProof

              ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

ACTIVE(dbl1(X)) → ACTIVE(X)
ACTIVE(quote(X)) → ACTIVE(X)
ACTIVE(dbl(X)) → ACTIVE(X)
ACTIVE(indx(X1, X2)) → ACTIVE(X1)
ACTIVE(dbls(X)) → ACTIVE(X)
ACTIVE(s1(X)) → ACTIVE(X)

The TRS R consists of the following rules:

active(dbl(0)) → mark(0)
active(dbl(s(X))) → mark(s(s(dbl(X))))
active(dbls(nil)) → mark(nil)
active(dbls(cons(X, Y))) → mark(cons(dbl(X), dbls(Y)))
active(sel(0, cons(X, Y))) → mark(X)
active(sel(s(X), cons(Y, Z))) → mark(sel(X, Z))
active(indx(nil, X)) → mark(nil)
active(indx(cons(X, Y), Z)) → mark(cons(sel(X, Z), indx(Y, Z)))
active(from(X)) → mark(cons(X, from(s(X))))
active(dbl1(0)) → mark(01)
active(dbl1(s(X))) → mark(s1(s1(dbl1(X))))
active(sel1(0, cons(X, Y))) → mark(X)
active(sel1(s(X), cons(Y, Z))) → mark(sel1(X, Z))
active(quote(0)) → mark(01)
active(quote(s(X))) → mark(s1(quote(X)))
active(quote(dbl(X))) → mark(dbl1(X))
active(quote(sel(X, Y))) → mark(sel1(X, Y))
active(dbl(X)) → dbl(active(X))
active(dbls(X)) → dbls(active(X))
active(sel(X1, X2)) → sel(active(X1), X2)
active(sel(X1, X2)) → sel(X1, active(X2))
active(indx(X1, X2)) → indx(active(X1), X2)
active(dbl1(X)) → dbl1(active(X))
active(s1(X)) → s1(active(X))
active(sel1(X1, X2)) → sel1(active(X1), X2)
active(sel1(X1, X2)) → sel1(X1, active(X2))
active(quote(X)) → quote(active(X))
dbl(mark(X)) → mark(dbl(X))
dbls(mark(X)) → mark(dbls(X))
sel(mark(X1), X2) → mark(sel(X1, X2))
sel(X1, mark(X2)) → mark(sel(X1, X2))
indx(mark(X1), X2) → mark(indx(X1, X2))
dbl1(mark(X)) → mark(dbl1(X))
s1(mark(X)) → mark(s1(X))
sel1(mark(X1), X2) → mark(sel1(X1, X2))
sel1(X1, mark(X2)) → mark(sel1(X1, X2))
quote(mark(X)) → mark(quote(X))
proper(dbl(X)) → dbl(proper(X))
proper(0) → ok(0)
proper(s(X)) → s(proper(X))
proper(dbls(X)) → dbls(proper(X))
proper(nil) → ok(nil)
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(sel(X1, X2)) → sel(proper(X1), proper(X2))
proper(indx(X1, X2)) → indx(proper(X1), proper(X2))
proper(from(X)) → from(proper(X))
proper(dbl1(X)) → dbl1(proper(X))
proper(01) → ok(01)
proper(s1(X)) → s1(proper(X))
proper(sel1(X1, X2)) → sel1(proper(X1), proper(X2))
proper(quote(X)) → quote(proper(X))
dbl(ok(X)) → ok(dbl(X))
s(ok(X)) → ok(s(X))
dbls(ok(X)) → ok(dbls(X))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
sel(ok(X1), ok(X2)) → ok(sel(X1, X2))
indx(ok(X1), ok(X2)) → ok(indx(X1, X2))
from(ok(X)) → ok(from(X))
dbl1(ok(X)) → ok(dbl1(X))
s1(ok(X)) → ok(s1(X))
sel1(ok(X1), ok(X2)) → ok(sel1(X1, X2))
quote(ok(X)) → ok(quote(X))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].

The following pairs can be oriented strictly and are deleted.

ACTIVE(s1(X)) → ACTIVE(X)

The remaining pairs can at least be oriented weakly.

ACTIVE(dbl1(X)) → ACTIVE(X)
ACTIVE(quote(X)) → ACTIVE(X)
ACTIVE(dbl(X)) → ACTIVE(X)
ACTIVE(indx(X1, X2)) → ACTIVE(X1)
ACTIVE(dbls(X)) → ACTIVE(X)

Used ordering: Combined order from the following AFS and order.
ACTIVE(x1) = x1
dbl1(x1) = x1
quote(x1) = x1
dbl(x1) = x1
indx(x1, x2) = x1
dbls(x1) = x1
s1(x1) = s1(x1)

Lexicographic Path Order [19].
Precedence:

trivial

The following usable rules [14] were oriented: none

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ EdgeDeletionProof

        ↳ QDP

          ↳ DependencyGraphProof

            ↳ AND

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

                ↳ QDPOrderProof

                  ↳ QDP

                    ↳ QDPOrderProof

                      ↳ QDP

                        ↳ QDPOrderProof

              ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

ACTIVE(dbl1(X)) → ACTIVE(X)
ACTIVE(quote(X)) → ACTIVE(X)
ACTIVE(indx(X1, X2)) → ACTIVE(X1)
ACTIVE(dbl(X)) → ACTIVE(X)
ACTIVE(dbls(X)) → ACTIVE(X)

The TRS R consists of the following rules:

active(dbl(0)) → mark(0)
active(dbl(s(X))) → mark(s(s(dbl(X))))
active(dbls(nil)) → mark(nil)
active(dbls(cons(X, Y))) → mark(cons(dbl(X), dbls(Y)))
active(sel(0, cons(X, Y))) → mark(X)
active(sel(s(X), cons(Y, Z))) → mark(sel(X, Z))
active(indx(nil, X)) → mark(nil)
active(indx(cons(X, Y), Z)) → mark(cons(sel(X, Z), indx(Y, Z)))
active(from(X)) → mark(cons(X, from(s(X))))
active(dbl1(0)) → mark(01)
active(dbl1(s(X))) → mark(s1(s1(dbl1(X))))
active(sel1(0, cons(X, Y))) → mark(X)
active(sel1(s(X), cons(Y, Z))) → mark(sel1(X, Z))
active(quote(0)) → mark(01)
active(quote(s(X))) → mark(s1(quote(X)))
active(quote(dbl(X))) → mark(dbl1(X))
active(quote(sel(X, Y))) → mark(sel1(X, Y))
active(dbl(X)) → dbl(active(X))
active(dbls(X)) → dbls(active(X))
active(sel(X1, X2)) → sel(active(X1), X2)
active(sel(X1, X2)) → sel(X1, active(X2))
active(indx(X1, X2)) → indx(active(X1), X2)
active(dbl1(X)) → dbl1(active(X))
active(s1(X)) → s1(active(X))
active(sel1(X1, X2)) → sel1(active(X1), X2)
active(sel1(X1, X2)) → sel1(X1, active(X2))
active(quote(X)) → quote(active(X))
dbl(mark(X)) → mark(dbl(X))
dbls(mark(X)) → mark(dbls(X))
sel(mark(X1), X2) → mark(sel(X1, X2))
sel(X1, mark(X2)) → mark(sel(X1, X2))
indx(mark(X1), X2) → mark(indx(X1, X2))
dbl1(mark(X)) → mark(dbl1(X))
s1(mark(X)) → mark(s1(X))
sel1(mark(X1), X2) → mark(sel1(X1, X2))
sel1(X1, mark(X2)) → mark(sel1(X1, X2))
quote(mark(X)) → mark(quote(X))
proper(dbl(X)) → dbl(proper(X))
proper(0) → ok(0)
proper(s(X)) → s(proper(X))
proper(dbls(X)) → dbls(proper(X))
proper(nil) → ok(nil)
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(sel(X1, X2)) → sel(proper(X1), proper(X2))
proper(indx(X1, X2)) → indx(proper(X1), proper(X2))
proper(from(X)) → from(proper(X))
proper(dbl1(X)) → dbl1(proper(X))
proper(01) → ok(01)
proper(s1(X)) → s1(proper(X))
proper(sel1(X1, X2)) → sel1(proper(X1), proper(X2))
proper(quote(X)) → quote(proper(X))
dbl(ok(X)) → ok(dbl(X))
s(ok(X)) → ok(s(X))
dbls(ok(X)) → ok(dbls(X))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
sel(ok(X1), ok(X2)) → ok(sel(X1, X2))
indx(ok(X1), ok(X2)) → ok(indx(X1, X2))
from(ok(X)) → ok(from(X))
dbl1(ok(X)) → ok(dbl1(X))
s1(ok(X)) → ok(s1(X))
sel1(ok(X1), ok(X2)) → ok(sel1(X1, X2))
quote(ok(X)) → ok(quote(X))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].

The following pairs can be oriented strictly and are deleted.

ACTIVE(dbls(X)) → ACTIVE(X)

The remaining pairs can at least be oriented weakly.

ACTIVE(dbl1(X)) → ACTIVE(X)
ACTIVE(quote(X)) → ACTIVE(X)
ACTIVE(indx(X1, X2)) → ACTIVE(X1)
ACTIVE(dbl(X)) → ACTIVE(X)

Used ordering: Combined order from the following AFS and order.
ACTIVE(x1) = x1
dbl1(x1) = x1
quote(x1) = x1
indx(x1, x2) = x1
dbl(x1) = x1
dbls(x1) = dbls(x1)

Lexicographic Path Order [19].
Precedence:

trivial

The following usable rules [14] were oriented: none

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ EdgeDeletionProof

        ↳ QDP

          ↳ DependencyGraphProof

            ↳ AND

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

                ↳ QDPOrderProof

                  ↳ QDP

                    ↳ QDPOrderProof

                      ↳ QDP

                        ↳ QDPOrderProof

                          ↳ QDP

                            ↳ QDPOrderProof

              ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

ACTIVE(dbl1(X)) → ACTIVE(X)
ACTIVE(quote(X)) → ACTIVE(X)
ACTIVE(dbl(X)) → ACTIVE(X)
ACTIVE(indx(X1, X2)) → ACTIVE(X1)

The TRS R consists of the following rules:

active(dbl(0)) → mark(0)
active(dbl(s(X))) → mark(s(s(dbl(X))))
active(dbls(nil)) → mark(nil)
active(dbls(cons(X, Y))) → mark(cons(dbl(X), dbls(Y)))
active(sel(0, cons(X, Y))) → mark(X)
active(sel(s(X), cons(Y, Z))) → mark(sel(X, Z))
active(indx(nil, X)) → mark(nil)
active(indx(cons(X, Y), Z)) → mark(cons(sel(X, Z), indx(Y, Z)))
active(from(X)) → mark(cons(X, from(s(X))))
active(dbl1(0)) → mark(01)
active(dbl1(s(X))) → mark(s1(s1(dbl1(X))))
active(sel1(0, cons(X, Y))) → mark(X)
active(sel1(s(X), cons(Y, Z))) → mark(sel1(X, Z))
active(quote(0)) → mark(01)
active(quote(s(X))) → mark(s1(quote(X)))
active(quote(dbl(X))) → mark(dbl1(X))
active(quote(sel(X, Y))) → mark(sel1(X, Y))
active(dbl(X)) → dbl(active(X))
active(dbls(X)) → dbls(active(X))
active(sel(X1, X2)) → sel(active(X1), X2)
active(sel(X1, X2)) → sel(X1, active(X2))
active(indx(X1, X2)) → indx(active(X1), X2)
active(dbl1(X)) → dbl1(active(X))
active(s1(X)) → s1(active(X))
active(sel1(X1, X2)) → sel1(active(X1), X2)
active(sel1(X1, X2)) → sel1(X1, active(X2))
active(quote(X)) → quote(active(X))
dbl(mark(X)) → mark(dbl(X))
dbls(mark(X)) → mark(dbls(X))
sel(mark(X1), X2) → mark(sel(X1, X2))
sel(X1, mark(X2)) → mark(sel(X1, X2))
indx(mark(X1), X2) → mark(indx(X1, X2))
dbl1(mark(X)) → mark(dbl1(X))
s1(mark(X)) → mark(s1(X))
sel1(mark(X1), X2) → mark(sel1(X1, X2))
sel1(X1, mark(X2)) → mark(sel1(X1, X2))
quote(mark(X)) → mark(quote(X))
proper(dbl(X)) → dbl(proper(X))
proper(0) → ok(0)
proper(s(X)) → s(proper(X))
proper(dbls(X)) → dbls(proper(X))
proper(nil) → ok(nil)
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(sel(X1, X2)) → sel(proper(X1), proper(X2))
proper(indx(X1, X2)) → indx(proper(X1), proper(X2))
proper(from(X)) → from(proper(X))
proper(dbl1(X)) → dbl1(proper(X))
proper(01) → ok(01)
proper(s1(X)) → s1(proper(X))
proper(sel1(X1, X2)) → sel1(proper(X1), proper(X2))
proper(quote(X)) → quote(proper(X))
dbl(ok(X)) → ok(dbl(X))
s(ok(X)) → ok(s(X))
dbls(ok(X)) → ok(dbls(X))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
sel(ok(X1), ok(X2)) → ok(sel(X1, X2))
indx(ok(X1), ok(X2)) → ok(indx(X1, X2))
from(ok(X)) → ok(from(X))
dbl1(ok(X)) → ok(dbl1(X))
s1(ok(X)) → ok(s1(X))
sel1(ok(X1), ok(X2)) → ok(sel1(X1, X2))
quote(ok(X)) → ok(quote(X))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].

The following pairs can be oriented strictly and are deleted.

ACTIVE(indx(X1, X2)) → ACTIVE(X1)

The remaining pairs can at least be oriented weakly.

ACTIVE(dbl1(X)) → ACTIVE(X)
ACTIVE(quote(X)) → ACTIVE(X)
ACTIVE(dbl(X)) → ACTIVE(X)

Used ordering: Combined order from the following AFS and order.
ACTIVE(x1) = x1
dbl1(x1) = x1
quote(x1) = x1
dbl(x1) = x1
indx(x1, x2) = indx(x1)

Lexicographic Path Order [19].
Precedence:

trivial

The following usable rules [14] were oriented: none

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ EdgeDeletionProof

        ↳ QDP

          ↳ DependencyGraphProof

            ↳ AND

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

                ↳ QDPOrderProof

                  ↳ QDP

                    ↳ QDPOrderProof

                      ↳ QDP

                        ↳ QDPOrderProof

                          ↳ QDP

                            ↳ QDPOrderProof

                              ↳ QDP

                                ↳ QDPOrderProof

              ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

ACTIVE(dbl1(X)) → ACTIVE(X)
ACTIVE(quote(X)) → ACTIVE(X)
ACTIVE(dbl(X)) → ACTIVE(X)

The TRS R consists of the following rules:

active(dbl(0)) → mark(0)
active(dbl(s(X))) → mark(s(s(dbl(X))))
active(dbls(nil)) → mark(nil)
active(dbls(cons(X, Y))) → mark(cons(dbl(X), dbls(Y)))
active(sel(0, cons(X, Y))) → mark(X)
active(sel(s(X), cons(Y, Z))) → mark(sel(X, Z))
active(indx(nil, X)) → mark(nil)
active(indx(cons(X, Y), Z)) → mark(cons(sel(X, Z), indx(Y, Z)))
active(from(X)) → mark(cons(X, from(s(X))))
active(dbl1(0)) → mark(01)
active(dbl1(s(X))) → mark(s1(s1(dbl1(X))))
active(sel1(0, cons(X, Y))) → mark(X)
active(sel1(s(X), cons(Y, Z))) → mark(sel1(X, Z))
active(quote(0)) → mark(01)
active(quote(s(X))) → mark(s1(quote(X)))
active(quote(dbl(X))) → mark(dbl1(X))
active(quote(sel(X, Y))) → mark(sel1(X, Y))
active(dbl(X)) → dbl(active(X))
active(dbls(X)) → dbls(active(X))
active(sel(X1, X2)) → sel(active(X1), X2)
active(sel(X1, X2)) → sel(X1, active(X2))
active(indx(X1, X2)) → indx(active(X1), X2)
active(dbl1(X)) → dbl1(active(X))
active(s1(X)) → s1(active(X))
active(sel1(X1, X2)) → sel1(active(X1), X2)
active(sel1(X1, X2)) → sel1(X1, active(X2))
active(quote(X)) → quote(active(X))
dbl(mark(X)) → mark(dbl(X))
dbls(mark(X)) → mark(dbls(X))
sel(mark(X1), X2) → mark(sel(X1, X2))
sel(X1, mark(X2)) → mark(sel(X1, X2))
indx(mark(X1), X2) → mark(indx(X1, X2))
dbl1(mark(X)) → mark(dbl1(X))
s1(mark(X)) → mark(s1(X))
sel1(mark(X1), X2) → mark(sel1(X1, X2))
sel1(X1, mark(X2)) → mark(sel1(X1, X2))
quote(mark(X)) → mark(quote(X))
proper(dbl(X)) → dbl(proper(X))
proper(0) → ok(0)
proper(s(X)) → s(proper(X))
proper(dbls(X)) → dbls(proper(X))
proper(nil) → ok(nil)
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(sel(X1, X2)) → sel(proper(X1), proper(X2))
proper(indx(X1, X2)) → indx(proper(X1), proper(X2))
proper(from(X)) → from(proper(X))
proper(dbl1(X)) → dbl1(proper(X))
proper(01) → ok(01)
proper(s1(X)) → s1(proper(X))
proper(sel1(X1, X2)) → sel1(proper(X1), proper(X2))
proper(quote(X)) → quote(proper(X))
dbl(ok(X)) → ok(dbl(X))
s(ok(X)) → ok(s(X))
dbls(ok(X)) → ok(dbls(X))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
sel(ok(X1), ok(X2)) → ok(sel(X1, X2))
indx(ok(X1), ok(X2)) → ok(indx(X1, X2))
from(ok(X)) → ok(from(X))
dbl1(ok(X)) → ok(dbl1(X))
s1(ok(X)) → ok(s1(X))
sel1(ok(X1), ok(X2)) → ok(sel1(X1, X2))
quote(ok(X)) → ok(quote(X))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].

The following pairs can be oriented strictly and are deleted.

ACTIVE(dbl(X)) → ACTIVE(X)

The remaining pairs can at least be oriented weakly.

ACTIVE(dbl1(X)) → ACTIVE(X)
ACTIVE(quote(X)) → ACTIVE(X)

Used ordering: Combined order from the following AFS and order.
ACTIVE(x1) = x1
dbl1(x1) = x1
quote(x1) = x1
dbl(x1) = dbl(x1)

Lexicographic Path Order [19].
Precedence:

trivial

The following usable rules [14] were oriented: none

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ EdgeDeletionProof

        ↳ QDP

          ↳ DependencyGraphProof

            ↳ AND

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

                ↳ QDPOrderProof

                  ↳ QDP

                    ↳ QDPOrderProof

                      ↳ QDP

                        ↳ QDPOrderProof

                          ↳ QDP

                            ↳ QDPOrderProof

                              ↳ QDP

                                ↳ QDPOrderProof

                                  ↳ QDP

                                    ↳ QDPOrderProof

              ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

ACTIVE(dbl1(X)) → ACTIVE(X)
ACTIVE(quote(X)) → ACTIVE(X)

The TRS R consists of the following rules:

active(dbl(0)) → mark(0)
active(dbl(s(X))) → mark(s(s(dbl(X))))
active(dbls(nil)) → mark(nil)
active(dbls(cons(X, Y))) → mark(cons(dbl(X), dbls(Y)))
active(sel(0, cons(X, Y))) → mark(X)
active(sel(s(X), cons(Y, Z))) → mark(sel(X, Z))
active(indx(nil, X)) → mark(nil)
active(indx(cons(X, Y), Z)) → mark(cons(sel(X, Z), indx(Y, Z)))
active(from(X)) → mark(cons(X, from(s(X))))
active(dbl1(0)) → mark(01)
active(dbl1(s(X))) → mark(s1(s1(dbl1(X))))
active(sel1(0, cons(X, Y))) → mark(X)
active(sel1(s(X), cons(Y, Z))) → mark(sel1(X, Z))
active(quote(0)) → mark(01)
active(quote(s(X))) → mark(s1(quote(X)))
active(quote(dbl(X))) → mark(dbl1(X))
active(quote(sel(X, Y))) → mark(sel1(X, Y))
active(dbl(X)) → dbl(active(X))
active(dbls(X)) → dbls(active(X))
active(sel(X1, X2)) → sel(active(X1), X2)
active(sel(X1, X2)) → sel(X1, active(X2))
active(indx(X1, X2)) → indx(active(X1), X2)
active(dbl1(X)) → dbl1(active(X))
active(s1(X)) → s1(active(X))
active(sel1(X1, X2)) → sel1(active(X1), X2)
active(sel1(X1, X2)) → sel1(X1, active(X2))
active(quote(X)) → quote(active(X))
dbl(mark(X)) → mark(dbl(X))
dbls(mark(X)) → mark(dbls(X))
sel(mark(X1), X2) → mark(sel(X1, X2))
sel(X1, mark(X2)) → mark(sel(X1, X2))
indx(mark(X1), X2) → mark(indx(X1, X2))
dbl1(mark(X)) → mark(dbl1(X))
s1(mark(X)) → mark(s1(X))
sel1(mark(X1), X2) → mark(sel1(X1, X2))
sel1(X1, mark(X2)) → mark(sel1(X1, X2))
quote(mark(X)) → mark(quote(X))
proper(dbl(X)) → dbl(proper(X))
proper(0) → ok(0)
proper(s(X)) → s(proper(X))
proper(dbls(X)) → dbls(proper(X))
proper(nil) → ok(nil)
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(sel(X1, X2)) → sel(proper(X1), proper(X2))
proper(indx(X1, X2)) → indx(proper(X1), proper(X2))
proper(from(X)) → from(proper(X))
proper(dbl1(X)) → dbl1(proper(X))
proper(01) → ok(01)
proper(s1(X)) → s1(proper(X))
proper(sel1(X1, X2)) → sel1(proper(X1), proper(X2))
proper(quote(X)) → quote(proper(X))
dbl(ok(X)) → ok(dbl(X))
s(ok(X)) → ok(s(X))
dbls(ok(X)) → ok(dbls(X))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
sel(ok(X1), ok(X2)) → ok(sel(X1, X2))
indx(ok(X1), ok(X2)) → ok(indx(X1, X2))
from(ok(X)) → ok(from(X))
dbl1(ok(X)) → ok(dbl1(X))
s1(ok(X)) → ok(s1(X))
sel1(ok(X1), ok(X2)) → ok(sel1(X1, X2))
quote(ok(X)) → ok(quote(X))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].

The following pairs can be oriented strictly and are deleted.

ACTIVE(quote(X)) → ACTIVE(X)

The remaining pairs can at least be oriented weakly.

ACTIVE(dbl1(X)) → ACTIVE(X)

Used ordering: Combined order from the following AFS and order.
ACTIVE(x1) = x1
dbl1(x1) = x1
quote(x1) = quote(x1)

Lexicographic Path Order [19].
Precedence:

trivial

The following usable rules [14] were oriented: none

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ EdgeDeletionProof

        ↳ QDP

          ↳ DependencyGraphProof

            ↳ AND

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

                ↳ QDPOrderProof

                  ↳ QDP

                    ↳ QDPOrderProof

                      ↳ QDP

                        ↳ QDPOrderProof

                          ↳ QDP

                            ↳ QDPOrderProof

                              ↳ QDP

                                ↳ QDPOrderProof

                                  ↳ QDP

                                    ↳ QDPOrderProof

                                      ↳ QDP

                                        ↳ QDPOrderProof

              ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

ACTIVE(dbl1(X)) → ACTIVE(X)

The TRS R consists of the following rules:

active(dbl(0)) → mark(0)
active(dbl(s(X))) → mark(s(s(dbl(X))))
active(dbls(nil)) → mark(nil)
active(dbls(cons(X, Y))) → mark(cons(dbl(X), dbls(Y)))
active(sel(0, cons(X, Y))) → mark(X)
active(sel(s(X), cons(Y, Z))) → mark(sel(X, Z))
active(indx(nil, X)) → mark(nil)
active(indx(cons(X, Y), Z)) → mark(cons(sel(X, Z), indx(Y, Z)))
active(from(X)) → mark(cons(X, from(s(X))))
active(dbl1(0)) → mark(01)
active(dbl1(s(X))) → mark(s1(s1(dbl1(X))))
active(sel1(0, cons(X, Y))) → mark(X)
active(sel1(s(X), cons(Y, Z))) → mark(sel1(X, Z))
active(quote(0)) → mark(01)
active(quote(s(X))) → mark(s1(quote(X)))
active(quote(dbl(X))) → mark(dbl1(X))
active(quote(sel(X, Y))) → mark(sel1(X, Y))
active(dbl(X)) → dbl(active(X))
active(dbls(X)) → dbls(active(X))
active(sel(X1, X2)) → sel(active(X1), X2)
active(sel(X1, X2)) → sel(X1, active(X2))
active(indx(X1, X2)) → indx(active(X1), X2)
active(dbl1(X)) → dbl1(active(X))
active(s1(X)) → s1(active(X))
active(sel1(X1, X2)) → sel1(active(X1), X2)
active(sel1(X1, X2)) → sel1(X1, active(X2))
active(quote(X)) → quote(active(X))
dbl(mark(X)) → mark(dbl(X))
dbls(mark(X)) → mark(dbls(X))
sel(mark(X1), X2) → mark(sel(X1, X2))
sel(X1, mark(X2)) → mark(sel(X1, X2))
indx(mark(X1), X2) → mark(indx(X1, X2))
dbl1(mark(X)) → mark(dbl1(X))
s1(mark(X)) → mark(s1(X))
sel1(mark(X1), X2) → mark(sel1(X1, X2))
sel1(X1, mark(X2)) → mark(sel1(X1, X2))
quote(mark(X)) → mark(quote(X))
proper(dbl(X)) → dbl(proper(X))
proper(0) → ok(0)
proper(s(X)) → s(proper(X))
proper(dbls(X)) → dbls(proper(X))
proper(nil) → ok(nil)
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(sel(X1, X2)) → sel(proper(X1), proper(X2))
proper(indx(X1, X2)) → indx(proper(X1), proper(X2))
proper(from(X)) → from(proper(X))
proper(dbl1(X)) → dbl1(proper(X))
proper(01) → ok(01)
proper(s1(X)) → s1(proper(X))
proper(sel1(X1, X2)) → sel1(proper(X1), proper(X2))
proper(quote(X)) → quote(proper(X))
dbl(ok(X)) → ok(dbl(X))
s(ok(X)) → ok(s(X))
dbls(ok(X)) → ok(dbls(X))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
sel(ok(X1), ok(X2)) → ok(sel(X1, X2))
indx(ok(X1), ok(X2)) → ok(indx(X1, X2))
from(ok(X)) → ok(from(X))
dbl1(ok(X)) → ok(dbl1(X))
s1(ok(X)) → ok(s1(X))
sel1(ok(X1), ok(X2)) → ok(sel1(X1, X2))
quote(ok(X)) → ok(quote(X))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].

The following pairs can be oriented strictly and are deleted.

ACTIVE(dbl1(X)) → ACTIVE(X)

The remaining pairs can at least be oriented weakly.
none
Used ordering: Combined order from the following AFS and order.
ACTIVE(x1) = x1
dbl1(x1) = dbl1(x1)

Lexicographic Path Order [19].
Precedence:

trivial

The following usable rules [14] were oriented: none

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ EdgeDeletionProof

        ↳ QDP

          ↳ DependencyGraphProof

            ↳ AND

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

                ↳ QDPOrderProof

                  ↳ QDP

                    ↳ QDPOrderProof

                      ↳ QDP

                        ↳ QDPOrderProof

                          ↳ QDP

                            ↳ QDPOrderProof

                              ↳ QDP

                                ↳ QDPOrderProof

                                  ↳ QDP

                                    ↳ QDPOrderProof

                                      ↳ QDP

                                        ↳ QDPOrderProof

                                          ↳ QDP

                                            ↳ PisEmptyProof

              ↳ QDP

Q DP problem:
P is empty.
The TRS R consists of the following rules:

active(dbl(0)) → mark(0)
active(dbl(s(X))) → mark(s(s(dbl(X))))
active(dbls(nil)) → mark(nil)
active(dbls(cons(X, Y))) → mark(cons(dbl(X), dbls(Y)))
active(sel(0, cons(X, Y))) → mark(X)
active(sel(s(X), cons(Y, Z))) → mark(sel(X, Z))
active(indx(nil, X)) → mark(nil)
active(indx(cons(X, Y), Z)) → mark(cons(sel(X, Z), indx(Y, Z)))
active(from(X)) → mark(cons(X, from(s(X))))
active(dbl1(0)) → mark(01)
active(dbl1(s(X))) → mark(s1(s1(dbl1(X))))
active(sel1(0, cons(X, Y))) → mark(X)
active(sel1(s(X), cons(Y, Z))) → mark(sel1(X, Z))
active(quote(0)) → mark(01)
active(quote(s(X))) → mark(s1(quote(X)))
active(quote(dbl(X))) → mark(dbl1(X))
active(quote(sel(X, Y))) → mark(sel1(X, Y))
active(dbl(X)) → dbl(active(X))
active(dbls(X)) → dbls(active(X))
active(sel(X1, X2)) → sel(active(X1), X2)
active(sel(X1, X2)) → sel(X1, active(X2))
active(indx(X1, X2)) → indx(active(X1), X2)
active(dbl1(X)) → dbl1(active(X))
active(s1(X)) → s1(active(X))
active(sel1(X1, X2)) → sel1(active(X1), X2)
active(sel1(X1, X2)) → sel1(X1, active(X2))
active(quote(X)) → quote(active(X))
dbl(mark(X)) → mark(dbl(X))
dbls(mark(X)) → mark(dbls(X))
sel(mark(X1), X2) → mark(sel(X1, X2))
sel(X1, mark(X2)) → mark(sel(X1, X2))
indx(mark(X1), X2) → mark(indx(X1, X2))
dbl1(mark(X)) → mark(dbl1(X))
s1(mark(X)) → mark(s1(X))
sel1(mark(X1), X2) → mark(sel1(X1, X2))
sel1(X1, mark(X2)) → mark(sel1(X1, X2))
quote(mark(X)) → mark(quote(X))
proper(dbl(X)) → dbl(proper(X))
proper(0) → ok(0)
proper(s(X)) → s(proper(X))
proper(dbls(X)) → dbls(proper(X))
proper(nil) → ok(nil)
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(sel(X1, X2)) → sel(proper(X1), proper(X2))
proper(indx(X1, X2)) → indx(proper(X1), proper(X2))
proper(from(X)) → from(proper(X))
proper(dbl1(X)) → dbl1(proper(X))
proper(01) → ok(01)
proper(s1(X)) → s1(proper(X))
proper(sel1(X1, X2)) → sel1(proper(X1), proper(X2))
proper(quote(X)) → quote(proper(X))
dbl(ok(X)) → ok(dbl(X))
s(ok(X)) → ok(s(X))
dbls(ok(X)) → ok(dbls(X))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
sel(ok(X1), ok(X2)) → ok(sel(X1, X2))
indx(ok(X1), ok(X2)) → ok(indx(X1, X2))
from(ok(X)) → ok(from(X))
dbl1(ok(X)) → ok(dbl1(X))
s1(ok(X)) → ok(s1(X))
sel1(ok(X1), ok(X2)) → ok(sel1(X1, X2))
quote(ok(X)) → ok(quote(X))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The TRS P is empty. Hence, there is no (P,Q,R) chain.

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ EdgeDeletionProof

        ↳ QDP

          ↳ DependencyGraphProof

            ↳ AND

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

TOP(ok(X)) → TOP(active(X))
TOP(mark(X)) → TOP(proper(X))

The TRS R consists of the following rules:

active(dbl(0)) → mark(0)
active(dbl(s(X))) → mark(s(s(dbl(X))))
active(dbls(nil)) → mark(nil)
active(dbls(cons(X, Y))) → mark(cons(dbl(X), dbls(Y)))
active(sel(0, cons(X, Y))) → mark(X)
active(sel(s(X), cons(Y, Z))) → mark(sel(X, Z))
active(indx(nil, X)) → mark(nil)
active(indx(cons(X, Y), Z)) → mark(cons(sel(X, Z), indx(Y, Z)))
active(from(X)) → mark(cons(X, from(s(X))))
active(dbl1(0)) → mark(01)
active(dbl1(s(X))) → mark(s1(s1(dbl1(X))))
active(sel1(0, cons(X, Y))) → mark(X)
active(sel1(s(X), cons(Y, Z))) → mark(sel1(X, Z))
active(quote(0)) → mark(01)
active(quote(s(X))) → mark(s1(quote(X)))
active(quote(dbl(X))) → mark(dbl1(X))
active(quote(sel(X, Y))) → mark(sel1(X, Y))
active(dbl(X)) → dbl(active(X))
active(dbls(X)) → dbls(active(X))
active(sel(X1, X2)) → sel(active(X1), X2)
active(sel(X1, X2)) → sel(X1, active(X2))
active(indx(X1, X2)) → indx(active(X1), X2)
active(dbl1(X)) → dbl1(active(X))
active(s1(X)) → s1(active(X))
active(sel1(X1, X2)) → sel1(active(X1), X2)
active(sel1(X1, X2)) → sel1(X1, active(X2))
active(quote(X)) → quote(active(X))
dbl(mark(X)) → mark(dbl(X))
dbls(mark(X)) → mark(dbls(X))
sel(mark(X1), X2) → mark(sel(X1, X2))
sel(X1, mark(X2)) → mark(sel(X1, X2))
indx(mark(X1), X2) → mark(indx(X1, X2))
dbl1(mark(X)) → mark(dbl1(X))
s1(mark(X)) → mark(s1(X))
sel1(mark(X1), X2) → mark(sel1(X1, X2))
sel1(X1, mark(X2)) → mark(sel1(X1, X2))
quote(mark(X)) → mark(quote(X))
proper(dbl(X)) → dbl(proper(X))
proper(0) → ok(0)
proper(s(X)) → s(proper(X))
proper(dbls(X)) → dbls(proper(X))
proper(nil) → ok(nil)
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(sel(X1, X2)) → sel(proper(X1), proper(X2))
proper(indx(X1, X2)) → indx(proper(X1), proper(X2))
proper(from(X)) → from(proper(X))
proper(dbl1(X)) → dbl1(proper(X))
proper(01) → ok(01)
proper(s1(X)) → s1(proper(X))
proper(sel1(X1, X2)) → sel1(proper(X1), proper(X2))
proper(quote(X)) → quote(proper(X))
dbl(ok(X)) → ok(dbl(X))
s(ok(X)) → ok(s(X))
dbls(ok(X)) → ok(dbls(X))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
sel(ok(X1), ok(X2)) → ok(sel(X1, X2))
indx(ok(X1), ok(X2)) → ok(indx(X1, X2))
from(ok(X)) → ok(from(X))
dbl1(ok(X)) → ok(dbl1(X))
s1(ok(X)) → ok(s1(X))
sel1(ok(X1), ok(X2)) → ok(sel1(X1, X2))
quote(ok(X)) → ok(quote(X))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.